Maximum Subarray 最大子段和

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

解法一：

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int sum = 0;
        int ans = INT_MIN;
        for(auto n : nums){
            sum += n;
            ans = max(ans, sum);
            if(sum < 0)
                sum = 0;
        }
        return ans;
    }
};

解法二：dp[i] 表示前i个数的最大子段和

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