leetcode-53. Maximum Subarray

最新推荐文章于 2022-02-27 16:46:09 发布

myan991

最新推荐文章于 2022-02-27 16:46:09 发布

阅读量225

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/myan991/article/details/62470721

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了解决LeetCode上第53题最大子数组和问题的一种高效算法实现。通过动态规划思想，代码简洁且易于理解。算法在遍历数组过程中不断更新当前子数组的最大和与整体最大和。

leetcode-53. 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.

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int res = nums[0];
        int curNum = nums[0];
        for(int i =1; i < nums.size(); ++i){
            curNum = (nums[i] < curNum+nums[i])? curNum+nums[i]:nums[i]; //想明白是哪两个比较
            res = (res < curNum)? curNum:res;
        }
        return res;
    }
};