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

Update Leetcode 题解.md

Browse Source 
maxSubArray优化代码，没有必要初始化一个n长度的数组
This commit is contained in:
HarryHa 2018-03-01 21:16:34 +08:00 committed by GitHub
parent 48c4b15aba
commit ec2486d3ef
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
notes/Leetcode 题解.md
View File

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