algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-28 04:42:48 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-04-07 02:41:53 +08:00
parent d2b52743bb
commit aea68142f8
45 changed files with 242 additions and 242 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
zh-Hant/docs/chapter_dynamic_programming/index.md
View File

@ -13,12 +13,12 @@ icon: material/table-pivot
動態規劃將小問題的解彙集成大問題的答案，一步步引領我們走向解決問題的彼岸。
## 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/)
- [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)