【刷题·动态规划】最大子序列和

代码

/*
 * @lc app=leetcode.cn id=53 lang=cpp
 *
 * [53] 最大子数组和
 */
#include<vector>
using namespace std;

// @lc code=start
class Solution {
public:
    int maxSubArray(vector<int>& nums) 
    {
        int size = nums.size();
        if(size == 1) return nums[0];

        int maxSum = nums[0];
        int curSum = 0;
        for(int i=0; i<size; ++i)
        {
            curSum +=nums[i];
            if(curSum > maxSum) maxSum = curSum;
            if(curSum < 0)
            {
                curSum = 0;
            }
        }
        return maxSum;
    }
};
// @lc code=end

结果

Accepted
210/210 cases passed (92 ms)
Your runtime beats 63.4 % of cpp submissions
Your memory usage beats 82.52 % of cpp submissions (66.4 MB)