algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-22 07:24:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-04-03 15:21:48 +08:00
parent bbecc9b4bc
commit bc7be3b8b7
4 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_dynamic_programming/intro_to_dynamic_programming.md
View File

@ -1396,7 +1396,7 @@ $$
根据以上内容，我们可以总结出动态规划的常用术语。
- 将数组 `dp` 称为<u>$dp$（表）</u>，$dp[i]$ 表示状态 $i$ 对应子问题的解。
- 将数组 `dp` 称为<u>dp 表</u>，$dp[i]$ 表示状态 $i$ 对应子问题的解。
- 将最小子问题对应的状态（第 $1$ 阶和第 $2$ 阶楼梯）称为<u>初始状态</u>。
- 将递推公式 $dp[i] = dp[i-1] + dp[i-2]$ 称为<u>状态转移方程</u>。