[LeetCode] Maximum Subarray

Problem

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.

Solution 1

动态规划问题。建立一个与原数列nums长度相同的数列dp，dp中的每一个值dp[i]表示以位置i为终点的子数列的最大和。如果dp[i-1]>0,那么dp[i]=dp[i-1]+A[i]；否则dp[i]=A[i]。dp中的最大值就是最大连续子数列之和。该方法的时间复杂度和空间复杂度都为O(n)。

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        vector<int> dp(nums.size());
        dp[0] = nums[0];
            
        int maxSum = nums[0];
            
        if(nums.size() ==  1) return nums[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];
            if(dp[i] > maxSum) maxSum = dp[i];
        }
            
        return maxSum;
    }
};

Solution 2

是Solution 1的优化，在遍历过程中将最优解直接求出来。遍历一遍数组，用一个变量保存当前位置（局部）的最大和，再筛选出全局最大和。该方法叫做Kadane算法，时间复杂度为O(n), 空间复杂度为O(1)。使用该方法也可以比较容易得到该子序列的开始和结束的位置。

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int res = nums[0], curSum = 0;
        for(int num : nums) {
            curSum = max(num, num + curSum);
            res = max(res, curSum);
        }
        return res;
    }
};

Solution 3

分治法。最大子序列无非出现在三个位置：左边、右边、中间，于是想到用递归的思路。

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        return helper(nums,0,nums.size()-1);
    }
    int helper(vector<int>& nums, int left, int right){
        if(left > right)
            return INT_MIN;
        int mid = (left + right)/2;
        int leftMax = 0,sum = 0;
        for(int i = mid-1; i >= left; i--){
            sum += nums[i];
            leftMax = sum > leftMax ? sum : leftMax;
        }
        int rightMax = 0;
        sum = 0;
        for(int i = mid+1; i <= right; i++){
            sum += nums[i];
            rightMax = sum > rightMax ? sum : rightMax;
        }
        int leftAns = helper(nums,left,mid-1);
        int rightAns = helper(nums,mid+1,right);
        return max(leftMax + rightMax + nums[mid], max(leftAns,rightAns));
    }
};