Leetcode_动态规划_53. 最大子序和

53. 最大子序和

思路：

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        length = len(nums)
        if not nums:
            return 0
        max_sum = nums[0]
        sums = 0
        for i in range(0, length):
            sums += nums[i]
            max_sum = max(max_sum, sums)
            if sums < 0:
                sums = 0
        return max_sum