动态规划(滑动窗口):
class Solution {
public int maxSubArray(int[] nums) {
int len = nums.length, maxSum = nums[0];
for(int i = 1; i < len; ++i) {
nums[i] += Math.max(nums[i-1], 0);
maxSum = Math.max(nums[i], maxSum);
}
return maxSum;
}
}