LeetCode OJ:Maximum Subarray

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.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

经典的动态规划题，两种思路：

1、dp[i]表示0~i（包括i）的最长子序列和，有

dp[i]=max(A[i],dp[i-1]+A[i])，则result=max{dp[t]}

class Solution {
public:
    int maxSubArray(int A[], int n) {
        int sum=0,maxSum=INT_MIN;
        for(int i=0;i<n;i++){
            if(sum>=0)sum+=A[i];
            else sum=A[i];
            maxSum=max(maxSum,sum);
        }
        return maxSum;
    }
};

2、dp[i]表示0~i（不一定包括i）的最长子序列和，有

设sum[i]表示A0~Ai的和

dp[i]=max{dp[i-1],sum[i]-min{sum[t]}}  0<=t<i

class Solution {
public:
    int maxSubArray(int A[], int n) {
        int dp=INT_MIN;
        int minV=INT_MAX;
        int sum=0;
        for(int i=0;i<n;i++){
            minV=min(minV,sum);
            sum+=A[i];
            dp=max(dp,sum-minV);
        }
        return dp;
    }
};

2（续）dp[i]表示i到n（不一定包括i）的最长子序列和，有

设sum[i]表示A0~Ai的和

dp[i]=max{dp[i+1],max{sum[t]}-sum[i-1]}    i<=t<=n

因为从后向前遍历，所以sum数组必须事先生成

class Solution {
public:
    int maxSubArray(int A[], int n) {
        
        int sum[n];
        for(int i=0;i<n;i++)
            sum[i]=i==0?A[i]:sum[i-1]+A[i];
            
        int dp=INT_MIN;
        int maxV=INT_MIN;
        
        for(int i=n-1;i>=0;i--){
            maxV=max(maxV,sum[i]);
            dp=max(dp,maxV-(i==0?0:sum[i-1]));
        }
        return dp;
    }
};