-
Notifications
You must be signed in to change notification settings - Fork 128
/
KadaneAlgo.java
53 lines (40 loc) · 959 Bytes
/
KadaneAlgo.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
package binarySearchAlgo;
public class KadaneAlgo {
public static void main(String[] args) {
int a[] = {2,3,-5,6,-2,4}; //mix array
int b[] = {-9,-5,-6,-4}; //negative array
int result = maxSumSubArray(a);
int result1 = maxSumSubArrayAllNegative(b);
System.out.println(result);
System.out.println(result1);
}
static int maxSumSubArray(int a[]) {
int maxsum =0;
int cursum = 0;
for(int i =0; i <a.length;i++) {
cursum = cursum + a[i];
if(cursum > maxsum) {
maxsum = cursum;
}
if(cursum < 0) {
cursum = 0;
}
}
return maxsum;
}
static int maxSumSubArrayAllNegative(int a[]) {
int maxsum =a[0];
// int maxsum = Integer.MIN_VALUE;
int cursum = 0;
for(int i =0; i <a.length;i++) {
cursum = cursum + a[i];
if(cursum > maxsum) {
maxsum = cursum;
}
if(cursum < 0) {
cursum = 0;
}
}
return maxsum;
}
}