CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 02:10:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-08-30 02:52:29 +08:00
parent 9f30ce7260
commit 34d8dfd075
4 changed files with 23 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
chapter_greedy/max_product_cutting_problem.md
View File

@@ -53,7 +53,7 @@ $$
**贪心策略二**：在切分方案中，最多只应存在两个 $2$ 。因为三个 $2$ 总是可以被替换为两个 $3$ ，从而获得更大乘积。
![最优切分因子](max_product_cutting_problem.assets/max_product_cutting_greedy_infer3.png)
![最优切分因子](max_product_cutting_problem.assets/max_product_cutting_greedy_infer2.png)
<p align="center"> 图 15-15 &nbsp; 最优切分因子 </p>