53. Maximum Subarray My Submissions QuestionEditorial Solution

小菜鸟的leetcode

于 2016-05-04 13:21:13 发布

阅读量455

点赞数

CC 4.0 BY-SA版权

文章标签： intresting DP need another try

本文链接：https://blog.youkuaiyun.com/Scarlett_leetcode/article/details/51314131

本文介绍了一种寻找具有最大和的连续子数组的算法。通过动态规划方法解决此问题，并给出了具体的实现代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

找最大，最小值就要考虑 DP

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