LeetCode 0053 - Maximum Subarray

Reck Zhang

发布于 2021-08-11 10:37:21

2020

发布于 2021-08-11 10:37:21

文章被收录于专栏：Reck Zhang

Maximum Subarray

Desicription

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.

Solution

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-13，如有侵权请联系 cloudcommunity@tencent.com 删除

find