mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
0053.最大子序和(动态规划):调整笔误
This commit is contained in:
@ -42,7 +42,7 @@ dp[i]只有两个方向可以推出来:
|
||||
|
||||
dp[0]应该是多少呢?
|
||||
|
||||
更具dp[i]的定义,很明显dp[0]因为为nums[0]即dp[0] = nums[0]。
|
||||
根据dp[i]的定义,很明显dp[0]应为nums[0]即dp[0] = nums[0]。
|
||||
|
||||
4. 确定遍历顺序
|
||||
|
||||
|
Reference in New Issue
Block a user