-
Notifications
You must be signed in to change notification settings - Fork 38
/
Copy pathSubarray.java
58 lines (53 loc) · 1.13 KB
/
Subarray.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
54
55
56
57
58
public class Subarray {
public static void main(String[] args) {
int[] arr = { 10, 20, -30, 40 };
logic2(arr);
}
public static void logic1(int[] arr) {
int ans = Integer.MIN_VALUE;
for (int s = 0; s < arr.length; s++) {
for (int e = s; e < arr.length; e++) {
// System.out.println(s + " " + e);
int sum = 0;
for (int idx = s; idx <= e; idx++) {
System.out.print(arr[idx] + " ");
sum = sum + arr[idx];
}
System.out.println("=>" + sum);
if (sum > ans) {
ans = sum;
}
}
}
System.out.println(ans);
}
public static void logic2(int[] arr) {
int ans = Integer.MIN_VALUE;
for (int s = 0; s < arr.length; s++) {
int sum = 0;
for (int e = s; e < arr.length; e++) {
// System.out.println(s + " " + e);
sum = sum + arr[e];
System.out.println(sum);
if (sum > ans) {
ans = sum;
}
}
}
System.out.println("==" + ans);
System.out.println(ans);
}
public static void logic3(int[] arr) {
int sum = 0;
int max = 0;
for (int i = 0; i < arr.length; i++) {
sum = sum + arr[i];
if (sum < 0) {
sum = 0;
}
if (max < sum) {
max = sum;
}
}
}
}