You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 lines
851 B
23 lines
851 B
---
|
|
comments: true
|
|
icon: material/head-heart-outline
|
|
---
|
|
|
|
# 第 15 章 貪婪
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
向日葵朝著太陽轉動，時刻追求自身成長的最大可能。
|
|
|
|
貪婪策略在一輪輪的簡單選擇中，逐步導向最佳答案。
|
|
|
|
## 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/)
|