剑指42 连续子数组的最大和
class Solution {
public int maxSubArray(int[] nums) {
int curSum = 0, ansSum = nums[0];
for (int i = 0; i < nums.length; i++) {
curSum += nums[i];
if (curSum > ansSum)
ansSum = curSum;
if (curSum < 0)
curSum = 0;
}
return ansSum;
}
}