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
53. Maximum Subarray --- Easy[https://leetcode.com/proble...
53.最大子数组和[https://leetcode.cn/problems/maximum-subarray/]...
53. Maximum Subarray 如果当前和小于0，那加上不如不加，因此<0就不加了，local和global
53. Maximum Subarray Find the contiguous subarray within ...
53. Maximum Subarray Find the contiguous subarray within ...
53. 最大子序和[https://leetcode-cn.com/problems/maximum-subarr...
53. 最大子序和[https://leetcode-cn.com/problems/maximum-subarr...
53. 最大子序和[https://leetcode-cn.com/problems/maximum-subarr...
53. Maximum Subarray Description Given an integer array n...
53. Maximum Subarray Given an integer array nums, find th...
本文标题：53. Maximum Subarray [Easy] 最大子序
本文链接：https://www.haomeiwen.com/subject/ffdcfctx.html
网友评论