algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

0053.最大子序和（动态规划）：调整笔误

Browse Source
This commit is contained in:
qyg
2021-12-27 09:53:51 +08:00
parent e85e9e7275
commit eb2b5e756a
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0053.最大子序和（动态规划）.md
View File

@ -42,7 +42,7 @@ dp[i]只有两个方向可以推出来：
dp[0]应该是多少呢? dp[0]应该是多少呢?
更具dp[i]的定义，很明显dp[0]因为为nums[0]即dp[0] = nums[0]。 根据dp[i]的定义，很明显dp[0]应为nums[0]即dp[0] = nums[0]。
4. 确定遍历顺序 4. 确定遍历顺序