1
0
0
LeetCode53-最大子数组和

文章摘要
|

不多说了,特别简单
class Solution {
public int maxSubArray(int[] nums) {
int a = 0;
int maxAns = nums[0];
for(int i : nums){
a = Math.max(a + i, i);
maxAns = Math.max(maxAns, a);
}
return maxAns;
}
}