LeetCode 53. 最大子序和

题目描述

题解

动态规划

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