CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 11:39:44 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix some figures.

Browse Source
This commit is contained in:
krahets
2023-08-30 02:52:50 +08:00
parent d387d9d41d
commit db7975d51f
11 changed files with 9 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
docs/chapter_greedy/max_product_cutting_problem.assets/max_product_cutting_greedy_infer2.png
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 36 KiB

After

Width:  |  Height:  |  Size: 38 KiB

BIN
docs/chapter_greedy/max_product_cutting_problem.assets/max_product_cutting_greedy_infer3.png
View File

Binary file not shown.
Side by Side

Before

Width:  |  Height:  |  Size: 38 KiB

2
docs/chapter_greedy/max_product_cutting_problem.md
View File

@@ -44,7 +44,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)
总结以上，可推出以下贪心策略。