LeetCode #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.

click to show more practice.

这道题用动态规划比较简单，即定义以nums[i]为结尾的最大子串和为dp[i]，那么可以建立dp[i]和dp[i-1]的递推关系。当dp[i-1]大于0时，dp[i]=nums[i]+dp[i-1]；当dp[i-1]小于0时，加上dp[i-1]会让dp[i]更小，所以dp[i]=nums[i]。

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