给定一个整数数组
nums
,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。例如:输入:nums = [-2,1,-3,4,-1,2,1,-5,4]
输出:6
解释:连续子数组 [4,-1,2,1] 的和最大,为 6 。参考链接https://leetcode-cn.com/problems/maximum-subarray/
- 动态规划
定义: d p [ i ] dp[i] dp[i]表示从某个索引开始到 i i i最大的子序列的和
边界条件: d p [ 0 ] = n u m s [ 0 ] dp[0]=nums[0] dp[0]=nums[0]
状态转移方程: d p [ i ] = m a x ( n u m s [ i ] + d p [ i − 1 ] , n u m s [ i ] ) dp[i]=max(nums[i]+dp[i-1],nums[i]) dp[i]=max(nums[i]+dp[i−1],nums[i])
说明:最大值要么是当前值,要么是前一个最大值和当前值的和
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
n = len(nums)
dp = [nums[0]]
ans = nums[0]
for i in range(1,n):
dp.append(max(dp[i-1]+nums[i], nums[i]))
ans = max(dp[i],ans)
return ans
- 优化空间
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
n = len(nums)
ans = nums[0]
dp = nums[0]
for i in range(1,n):
dp = max(dp+nums[i],nums[i])
ans = max(dp,ans)
return ans