---
comments: true
icon: material/table-pivot
---

# 第 14 章   动态规划

<div class="center-table" markdown>

![动态规划](../assets/covers/chapter_dynamic_programming.jpg){ class="cover-image" }

</div>

!!! abstract

    小溪汇入河流，江河汇入大海。
    
    动态规划将小问题的解汇集成大问题的答案，一步步引领我们走向解决问题的彼岸。

## 本章内容

- [14.1 &nbsp; 初探动态规划](https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/)
- [14.2 &nbsp; DP 问题特性](https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/)
- [14.3 &nbsp; DP 解题思路](https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/)
- [14.4 &nbsp; 0-1 背包问题](https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/)
- [14.5 &nbsp; 完全背包问题](https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/)
- [14.6 &nbsp; 编辑距离问题](https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/)
- [14.7 &nbsp; 小结](https://www.hello-algo.com/chapter_dynamic_programming/summary/)