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.

click to show more practice.

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
     
        int size = nums.size();
        vector<int> sum(size);
        sum[size-1] = nums[size-1];
        for(int i=size-2;i>=0;i--)
        {
            if((nums[i] + sum[i+1]) > nums[i] )
                sum[i] = nums[i] + sum[i+1];
            else
                sum[i] = nums[i];
        }
        
        int maxsum = sum[0];
        for(int i=0;i<size;i++)
        {
            if(sum[i] > maxsum)
                maxsum = sum[i];
        }
        return maxsum;
    }
};

动态规划方程  Sum[i] = max{nums[i],  nums[i]+Sum[i+1]}

一般的动态规划方程，子问题是在之前的，而这道题目子问题是靠后的，所以有点小坑。