LeetCode 53: Maximum Subarray

最新推荐文章于 2020-07-21 10:35:30 发布

原创最新推荐文章于 2020-07-21 10:35:30 发布 · 293 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #DP

leetcode 专栏收录该内容

91 篇文章

订阅专栏

本文介绍了一种寻找具有最大和的连续子数组的方法。给定一个整数数组，任务是找到一个连续子数组（至少包含一个元素），使其总和最大。例如，在数组[-2,1,-3,4,-1,2,1,-5,4]中，连续子数组[4,-1,2,1]的总和最大为6。文章还讨论了O(n)解决方案，并提出了使用分治法的另一种解决方案。

Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

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

解题思路

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int maxSubSum = INT_MIN;
        int preSubSum = 0;
        for (int i = 0; i < nums.size(); ++i) {
            preSubSum = (preSubSum < 0) ? nums[i] : preSubSum + nums[i];

            maxSubSum = max(maxSubSum, preSubSum);
        }
        return maxSubSum;
    }
};