xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-09 22:16:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-08-20 23:27:50 +08:00
parent 68e11cfa34
commit 4d55cafd13
46 changed files with 174 additions and 162 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_dynamic_programming/dp_solution_pipeline.md
+1 -1
View File
@@ -34,7 +34,7 @@ status: new
动态规划的解题流程会因问题的性质和难度而有所不同，但通常遵循以下步骤：描述决策，定义状态，建立 $dp$ 表，推导状态转移方程，确定边界条件等。
为了更形象地展示解题步骤，我们使用一个经典问题「最小路径和」来举例。
为了更形象地展示解题步骤，我们使用一个经典问题“最小路径和”来举例。
!!! question