[Leetcode]53. Maximum Subarray

最新推荐文章于 2021-09-01 09:36:25 发布

原创最新推荐文章于 2021-09-01 09:36:25 发布 · 305 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文介绍了一种寻找含至少一个数的连续子数组并求其最大和的算法。以[-2,1,-3,4,-1,2,1,-5,4]为例，[4,-1,2,1]具有最大和为6。通过动态规划实现，关键步骤包括状态转移方程和全局最大值更新。

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.

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