-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaxSumSubArray.java
More file actions
49 lines (43 loc) · 1.62 KB
/
Copy pathMaxSumSubArray.java
File metadata and controls
49 lines (43 loc) · 1.62 KB
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
public class MaxSumSubArray {
public static void main(String[] args) {
int[] sampleArray = {-1, -3, -5, 0, 4, 8, 2};
int[] sampleArray1 = {-1, -3, -5, -1, -2, -3, -2};
System.out.println(sumOfMSubArray(sampleArray));
System.out.println(sumOfMSubArray(sampleArray1));
System.out.println(sumOfMSubArray(sampleArray1));
}
private static int sumOfMaxSubArray(int[] sampleArray) {
if (sampleArray == null || sampleArray.length == 0) {
return Integer.MIN_VALUE;
}
int maxSum = sampleArray[0];
int sum = sampleArray[0];
for (int i = 1; i < sampleArray.length; i++) {
sum = Math.max(sum + sampleArray[i], sampleArray[i]);
maxSum = Math.max(maxSum, sum);
}
return maxSum;
}
private static int findMaxArrayMember(int[] sampleArray) {
if (sampleArray == null || sampleArray.length == 0) {
throw new RuntimeException("INcorrect input");
}
int max = sampleArray[0];
for (int i = 1; i < sampleArray.length; i++) {
max = Math.max(max, sampleArray[i]);
}
return max;
}
private static int sumOfMSubArray(int[] sampleArray) {
if (sampleArray == null || sampleArray.length == 0) {
throw new RuntimeException("Incorrect input");
}
int maxSum = sampleArray[0];
int sum = sampleArray[0];
for (int i = 1; i < sampleArray.length; i++) {
sum = Math.max(sum + sampleArray[i], sampleArray[i]);
maxSum = Math.max(sum, maxSum);
}
return maxSum;
}
}