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
|
|
|
{ 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
|
|
|
## 本章内容
|
|
|
|
|
|
|
|
|
|
- [14.1 初探动态规划](https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/)
|
|
|
|
|
- [14.2 DP 问题特性](https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/)
|
|
|
|
|
- [14.3 DP 解题思路](https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/)
|
|
|
|
|
- [14.4 0-1 背包问题](https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/)
|
|
|
|
|
- [14.5 完全背包问题](https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/)
|
|
|
|
|
- [14.6 编辑距离问题](https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/)
|
|
|
|
|
- [14.7 小结](https://www.hello-algo.com/chapter_dynamic_programming/summary/)
|
