53. Maximum Subarray [Easy] 最大子序

2019-06-11  本文已影响0人  一个想当大佬的菜鸡

53. Maximum Subarray

53. Maximum Subarray

如果当前和小于0,那加上不如不加,因此<0就不加了,local和global

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = float('-inf')
        dp = [0] * len(nums)
        for i in range(len(nums)):
            if i == 0:
                dp[i] = nums[i]
            else:
                dp[i] = max(nums[i], nums[i] + dp[i-1])
            res = max(dp[i], res)
        return res
上一篇 下一篇

猜你喜欢

热点阅读