LeetCode:Maximum Subarray(最大连续子序列和DP)

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.

思路：最大连续子序列和。设状态为f[j],表示以s[j]结尾的最大连续子序列和，则状态转移方程为：

　　f[j]=max{f[j-1]+s[j],s[j]};

     target=max{f[j]};

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
     int result=INT_MIN,f=0;
     
     for(int i=0;i<nums.size();i++)
     {
         f=max(f+nums[i],nums[i]);
         result=max(result,f);
     }
     return result;
        
    }
};