LeetCode53. Maximum Subarray(最大子序和)

53. Maximum Subarray

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.

---

题目：给定一个整型数组，返回其中连续子串的最大和。

思路：动态规划。维护一个数组dp，dp[i]表示以nums[i]为结尾的子串的最大的和。

工程代码下载

#include <iostream>
#include<vector>
#include<limits>
#include<algorithm>

using namespace std;

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        vector<int> dp(nums.size());
        dp[0] = nums[0];
        int res = nums[0];
        //循环所有的终点
        for (size_t i = 1; i < nums.size(); i++){
            dp[i] = nums[i] + (dp[i - 1] > 0 ? dp[i - 1] : 0);
            res = max(res, dp[i]);
        }
        return res;
    }
};

int main()
{
    Solution sln;
    vector<int> test_case{ -2,1,-3,4,-1,2,1,-5,4 };
    std::cout << sln.maxSubArray(test_case) << endl;
    std::cout << "Hello World!\n";
}

---

带预处理的简单的暴力循环。

    int maxSubArray(vector<int>& nums) {
        vector<int> dp(nums);

        for (size_t i = 1; i < nums.size(); i++)
            dp[i] += dp[i - 1];

        int max;
        if (nums.size() > 0)
            max = nums[0];

        //循环所有的起点
        for (size_t i = 0; i < nums.size(); i++){
            //循环所有可能的终点
            for (size_t j = i; j < nums.size(); j++){
                int tmp = dp[j] - dp[i] + nums[i];
                if (tmp > max)
                    max = tmp;
            }
        }
        return max;
    }