2023-06-30 04:33:43 +08:00
|
|
|
---
|
|
|
|
comments: true
|
2023-07-17 17:51:03 +08:00
|
|
|
icon: material/table-pivot
|
2023-06-30 04:33:43 +08:00
|
|
|
---
|
|
|
|
|
2023-08-19 22:07:27 +08:00
|
|
|
# 第 14 章 动态规划
|
2023-06-30 04:33:43 +08:00
|
|
|
|
2023-11-09 05:13:48 +08:00
|
|
|
![动态规划](../assets/covers/chapter_dynamic_programming.jpg){ class="cover-image" }
|
2023-06-30 04:33:43 +08:00
|
|
|
|
2023-08-03 04:37:52 +08:00
|
|
|
!!! abstract
|
|
|
|
|
|
|
|
小溪汇入河流,江河汇入大海。
|
|
|
|
|
|
|
|
动态规划将小问题的解汇集成大问题的答案,一步步引领我们走向解决问题的彼岸。
|
|
|
|
|
2023-07-17 17:51:03 +08:00
|
|
|
## 本章内容
|
|
|
|
|
2024-04-07 02:41:53 +08:00
|
|
|
- [14.1 初探动态规划](intro_to_dynamic_programming.md)
|
|
|
|
- [14.2 DP 问题特性](dp_problem_features.md)
|
|
|
|
- [14.3 DP 解题思路](dp_solution_pipeline.md)
|
|
|
|
- [14.4 0-1 背包问题](knapsack_problem.md)
|
|
|
|
- [14.5 完全背包问题](unbounded_knapsack_problem.md)
|
|
|
|
- [14.6 编辑距离问题](edit_distance_problem.md)
|
|
|
|
- [14.7 小结](summary.md)
|