leetcode 53. Maximum Subarray

leetcode 53. Maximum Subarray

(Easy)

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.

Follow up:

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

• 核心思想:

  求最大子列和(子列至少一个数字)

• 思考: 考虑最大子列和的特征: 该子列的以第一个元素开头的子列的和均不小于0,否则这部分应该被舍弃.

代码:

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int ans=nums[0],i,j,sum=0;
        int n = nums.size();
        for(i=0;i<n;i++){
            sum+=nums[i];
            ans=max(sum,ans);
            sum=max(sum,0);
        }
        return ans;
    }
};

DP思路:

具体见leetcode讨论区帖子: https://leetcode.com/problems/maximum-subarray/discuss/20193/DP-solution-and-some-thoughts

考虑子问题: maxSubArray(int A[], int i) : 求A[0:i]之间的包含末尾元素的最大子列和

这种子问题和求A[i,j]之间的最大子列和相比, 灵活性不强, 但是好处是, 子问题和原问题的联系清楚起来了

maxSubArray(A, i) = maxSubArray(A, i - 1) > 0 ? maxSubArray(A, i - 1) : 0 + A[i]; 

代码:

class Solution {
public:
    int maxSubArray(vector<int>& A) {
        vector<int> B(A.size());
        int max = A[0];
        B[0] = max;
        for(int i=1;i < A.size();i++)
        {
            B[i] = B[i-1] > 0 ? B[i-1] + A[i]: A[i];
            max = max > B[i]? max : B[i];
        }
        return max;
    }
};

(感觉上面两种算法本质上是一样的,核心都在于舍弃小于零的子列部分,只是思考的方式不一样)

分治思路: (暂时没想出来,也不想看网上的代码)