动态规划+数组_连续子数组的最大和

传送

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """ 
        dp = []
        dp.append(nums[0])
        for i in range(len(nums)-1):
            if dp[i] < 0:
                dp.append(nums[i+1])
            else:
                dp.append(dp[i] + nums[i+1])
        return max(dp)