2024-04-06 03:02:20 +08:00
|
|
|
---
|
|
|
|
|
comments: true
|
|
|
|
|
icon: material/table-pivot
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
# 第 14 章 動態規劃
|
|
|
|
|
|
|
|
|
|
{ class="cover-image" }
|
|
|
|
|
|
|
|
|
|
!!! abstract
|
|
|
|
|
|
|
|
|
|
小溪匯入河流，江河匯入大海。
|
|
|
|
|
|
|
|
|
|
動態規劃將小問題的解彙集成大問題的答案，一步步引領我們走向解決問題的彼岸。
|
|
|
|
|
|
2024-04-07 02:41:53 +08:00
|
|
|
## 本章內容
|
2024-04-06 03:02:20 +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)
|
