algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-29 13:23:09 +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

12
zh-Hant/docs/chapter_greedy/index.md
View File

@ -13,10 +13,10 @@ icon: material/head-heart-outline
貪婪策略在一輪輪的簡單選擇中，逐步導向最佳答案。
## Chapter Contents
## 本章內容
- [15.1   貪婪演算法](https://www.hello-algo.com/en/chapter_greedy/greedy_algorithm/)
- [15.2   分數背包問題](https://www.hello-algo.com/en/chapter_greedy/fractional_knapsack_problem/)
- [15.3   最大容量問題](https://www.hello-algo.com/en/chapter_greedy/max_capacity_problem/)
- [15.4   最大切分乘積問題](https://www.hello-algo.com/en/chapter_greedy/max_product_cutting_problem/)
- [15.5   小結](https://www.hello-algo.com/en/chapter_greedy/summary/)
- [15.1   貪婪演算法](greedy_algorithm.md)
- [15.2   分數背包問題](fractional_knapsack_problem.md)
- [15.3   最大容量問題](max_capacity_problem.md)
- [15.4   最大切分乘積問題](max_product_cutting_problem.md)
- [15.5   小結](summary.md)