LeetCode53. 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.

求最大连续子序列的和

思路：先定义和为max，初始化为0。动态方程：如果max + nums[i] < nums[i]，则更新max的值为nums[i]，否则max = max+nums[i]。每次更新的max值存起来，然后找最大的值返回。

class Solution {
public:
int maxSubArray(vector<int>& nums) {

vector<int> res;
int max=0;
vector<int>::size_type sz = nums.size();

for (int i=0;i < sz;i++)
{
if (max + nums[i] < nums[i])
{

max = nums[i];
res.push_back(max);
}
else
{

max = max+nums[i];
res.push_back(max);
}
}

vector<int>::iterator biggest = max_element(res.begin(),res.end());

return *biggest;

}
};