LeetCode--53. Maximum Subarray

Pick One

---

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.

---

思路：

1.最优化问题可以通过动态规划解决，求最大子列和，状态转移方程：dp[i]=max(nums[i],dp[i-1]+nums[i]);

参考代码：

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

优化：

1.不用数组，直接用两个变量迭代。

参考代码：

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