- Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNo53.java
54 lines (49 loc) · 861 Bytes
/
No53.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
packageAlgorithm.leetcode.Array;
publicclassNo53 {
publicintmaxSubArray(int[] nums) {
intmid = 0;
intmax = 0;
for (inti = 0; i < nums.length; i++) {
mid = 0;
for (intj = i; j < nums.length; j++) {
mid += nums[i];
if (mid > max) {
max = mid;
}
}
}
returnmax;
}
publicintmaxSubArray01(int[] nums) {
intmax = Integer.MIN_VALUE;
intmid = 0;
for (inti = 0; i < nums.length; i++) {
if (mid < 0) {
mid = 0;
}
mid += nums[i];
if (mid > max) {
max = mid;
}
}
returnmax;
}
publicintmaxSubArray02(int[] nums) {
if (nums.length == 0) {
return0;
}
intsum = nums[0];
intmax = nums[0];
for (inti = 1; i < nums.length; i++) {
if (sum > 0) {
sum += nums[i];
} else {
sum = nums[i];
}
if (max < sum) {
max = sum;
}
}
returnmax;
}
}