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.

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int curSum=nums[0],res=nums[0];
        if(nums.size()==1)
            return res;
        for(int i=1;i<nums.size();i++)
        {

            curSum=max(curSum+nums[i],nums[i]);
            res=max(curSum,res);
        }
        return res;
    }
};

如果当前的curSum+num比num小，num即可作为新最大子列，这样已经考虑到了子列全为负的情况，而且时间复杂度为O（n）。