53 Maximum Subarray

1 题目

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.

2 尝试解

2.1 分析

求最大连续和，令saver[i]为以nums[i]结尾的最大连续和，则saver[i+1]=max(nums[i],nums[i]+saver[i])，即如果前面的最大连续和为负，那么就加上只会更小，不如断开，重新开始。如果前面的最大连续和为正，那么加上就会更大，saver[i+1]=saver[i] + nums[i]。

2.2 代码

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