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 max, i, maxSum;
        maxSum = max = nums[0];
        for(i = 1; i < nums.size(); i++){
            if(max<=0){
                max = nums[i];
            }else{
                max += nums[i];
            }    
            maxSum = maxSum>max?maxSum:max;   
        }
        return maxSum;       
    }
};