leetcode-华为专题-剑指 Offer 42. 连续子数组的最大和

 

 

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

 

posted @ 2021-08-18 11:53  三一一一317  阅读(38)  评论(0)    收藏  举报