mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 00:26:29 +08:00
56b20eff36
* .net 8.0 migration * update docs * revert change * revert change and update appendix docs * remove static * Update binary_search_insertion.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs --------- Co-authored-by: Yudong Jin <krahets@163.com>
39 lines
No EOL
1 KiB
C#
39 lines
No EOL
1 KiB
C#
/**
|
||
* File: max_product_cutting.cs
|
||
* Created Time: 2023-07-21
|
||
* Author: hpstory (hpstory1024@163.com)
|
||
*/
|
||
|
||
namespace hello_algo.chapter_greedy;
|
||
|
||
public class max_product_cutting {
|
||
/* 最大切分乘积:贪心 */
|
||
int MaxProductCutting(int n) {
|
||
// 当 n <= 3 时,必须切分出一个 1
|
||
if (n <= 3) {
|
||
return 1 * (n - 1);
|
||
}
|
||
// 贪心地切分出 3 ,a 为 3 的个数,b 为余数
|
||
int a = n / 3;
|
||
int b = n % 3;
|
||
if (b == 1) {
|
||
// 当余数为 1 时,将一对 1 * 3 转化为 2 * 2
|
||
return (int)Math.Pow(3, a - 1) * 2 * 2;
|
||
}
|
||
if (b == 2) {
|
||
// 当余数为 2 时,不做处理
|
||
return (int)Math.Pow(3, a) * 2;
|
||
}
|
||
// 当余数为 0 时,不做处理
|
||
return (int)Math.Pow(3, a);
|
||
}
|
||
|
||
[Test]
|
||
public void Test() {
|
||
int n = 58;
|
||
|
||
// 贪心算法
|
||
int res = MaxProductCutting(n);
|
||
Console.WriteLine("最大切分乘积为" + res);
|
||
}
|
||
} |