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
632 B
23 lines
632 B
---
|
|
comments: true
|
|
icon: material/head-heart-outline
|
|
---
|
|
|
|
# 第 15 章 貪婪
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
向日葵朝著太陽轉動，時刻追求自身成長的最大可能。
|
|
|
|
貪婪策略在一輪輪的簡單選擇中，逐步導向最佳答案。
|
|
|
|
## 本章內容
|
|
|
|
- [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)
|