【leetcode刷题】20T22-最大子序和

示例:
输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大，为 6。

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = nums[0]
        accum = nums[0]
        for n in nums[1:]:
            accum = max(n, accum + n)
            if accum > res:
                res = accum
        return res

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