Leetcode 53. Maximum Subarray

原题：
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array

[-2,1,-3,4,-1,2,1,-5,4]

,

the contiguous subarray

[4,-1,2,1]

has the largest sum =

6

.

解决方法：

用一个变量来保存当前的和，每次都取较大的和。当前和小于0时，表示前面的数没有累计的必要，将其设为0重新开始累计。

代码：

int maxSubArray(vector<int>& nums) {
int res = INT_MIN, cur = 0;
for(auto num: nums){
cur += num;
res = max(res, cur);
cur = max(0, cur);
}
return res;
}