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.
|
|
|
|
---
|
|
|
|
|
comments: true
|
|
|
|
|
icon: material/head-heart-outline
|
|
|
|
|
status: new
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
# 第 15 章 贪心
|
|
|
|
|
|
|
|
|
|
<div class="center-table" markdown>
|
|
|
|
|
|
|
|
|
|
{ width="600" }
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
!!! abstract
|
|
|
|
|
|
|
|
|
|
向日葵朝着太阳转动，时刻都在追求自身成长的最大可能。
|
|
|
|
|
|
|
|
|
|
贪心策略在一轮轮的简单选择中，逐步导向最佳的答案。
|
|
|
|
|
|
|
|
|
|
## 本章内容
|
|
|
|
|
|
|
|
|
|
- [15.1 贪心算法](https://www.hello-algo.com/chapter_greedy/greedy_algorithm/)
|
|
|
|
|
- [15.2 分数背包问题](https://www.hello-algo.com/chapter_greedy/fractional_knapsack_problem/)
|
|
|
|
|
- [15.3 最大容量问题](https://www.hello-algo.com/chapter_greedy/max_capacity_problem/)
|
|
|
|
|
- [15.4 最大切分乘积问题](https://www.hello-algo.com/chapter_greedy/max_product_cutting_problem/)
|
|
|
|
|
- [15.5 小结](https://www.hello-algo.com/chapter_greedy/summary/)
|
