Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-03-01 21:31:51 +08:00
parent 1e58118b24
commit 03803a65f5
1 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
notes/Leetcode 题解.md
View File

@ -2379,11 +2379,13 @@ class NumArray {
```java ```java
public int maxSubArray(int[] nums) { public int maxSubArray(int[] nums) {
int max = nums[0]; int n = nums.length;
int oldsum = nums[0]; int[] sum = new int[n];
for (int i = 1; i < nums.length; i++) { sum[0] = nums[0];
oldsum = (oldsum > 0 ? oldsum: 0) + nums[i]; int max = sum[0];
max = Math.max(max, oldsum); for(int i = 1; i < n; i++){
sum[i] = (sum[i-1] > 0 ? sum[i-1] : 0) + nums[i];
max = Math.max(max, sum[i]);
} }
return max; return max;
} }