Maximum Subarray

Source: Maximum Subarray - LeetCode

状态转移方程

题解

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        n=len(nums)
        for i in range(1,n):
            nums[i]=max(nums[i],nums[i] + nums[i - 1])
        return max(nums)