CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 02:21:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

1. lower-case nouns

Browse Source 
2. fix 2 figures
3. Replace some 「」 by “”
This commit is contained in:
krahets
2023-08-20 23:28:30 +08:00
parent 2626de8d0b
commit 981144e42d
48 changed files with 174 additions and 162 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_dynamic_programming/dp_solution_pipeline.md
View File

@@ -29,7 +29,7 @@
动态规划的解题流程会因问题的性质和难度而有所不同，但通常遵循以下步骤：描述决策，定义状态，建立 $dp$ 表，推导状态转移方程，确定边界条件等。
为了更形象地展示解题步骤，我们使用一个经典问题「最小路径和」来举例。
为了更形象地展示解题步骤，我们使用一个经典问题“最小路径和”来举例。
!!! question