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
629 B
23 lines
629 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)
|