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

# 第 14 章   動態規劃

![動態規劃](../assets/covers/chapter_dynamic_programming.jpg){ class="cover-image" }

!!! abstract

    小溪匯入河流，江河匯入大海。
    
    動態規劃將小問題的解彙集成大問題的答案，一步步引領我們走向解決問題的彼岸。

## Chapter Contents

- [14.1   初探動態規劃](https://www.hello-algo.com/en/chapter_dynamic_programming/intro_to_dynamic_programming/)
- [14.2   DP 問題特性](https://www.hello-algo.com/en/chapter_dynamic_programming/dp_problem_features/)
- [14.3   DP 解題思路](https://www.hello-algo.com/en/chapter_dynamic_programming/dp_solution_pipeline/)
- [14.4   0-1 背包問題](https://www.hello-algo.com/en/chapter_dynamic_programming/knapsack_problem/)
- [14.5   完全背包問題](https://www.hello-algo.com/en/chapter_dynamic_programming/unbounded_knapsack_problem/)
- [14.6   編輯距離問題](https://www.hello-algo.com/en/chapter_dynamic_programming/edit_distance_problem/)
- [14.7   小結](https://www.hello-algo.com/en/chapter_dynamic_programming/summary/)