https://leetcode-cn.com/problems/maximum-subarray/ (opens new window)

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]ww
        :rtype: int
        """
        """
         状态转移方程 max{f(i-1)+num[i], nums[i]}
        """

        '维护一个最大值list'

        size = len(nums)
        dp = [0 for _ in range(size)]

        dp[0] = nums[0]

        for i in range(1, size):
            dp[i] = max(dp[i-1]+nums[i], nums[i])
        
        return max(dp)