题目要求:
https://leetcode-cn.com/problems/maximum-subarray/
弄一个数组,dp[i]存到当前位置结束时最大的前缀和。
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
if not nums:
return 0
dp = [0] * len(nums)
dp[0] = nums[0]
for i in range(1, len(nums)):
if nums[i] < nums[i] + dp[i-1]:
dp[i] = dp[i-1] + nums[i]
else:
dp[i] = nums[i]
return max(dp)