53 Maximum Subarray

Maximum Subarray

一篇动态规划的文章：http://www.hawstein.com/posts/dp-novice-to-advanced.html

代码:

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int max = nums[0];
        int dp[nums.size()];
        dp[0] = nums[0];
        for (int i = 1; i < nums.size(); i++){
            dp[i] = (dp[i-1] > 0 ? dp[i-1] : 0) + nums[i];//状态方程
            max = max > dp[i] ? max : dp[i];
        }
        return max;
    }
};