mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 23:56:29 +08:00
f62256bee1
* Modify method name to PascalCase(array and linked list) * Modify method name to PascalCase(backtracking) * Modify method name to PascalCase(computational complexity) * Modify method name to PascalCase(divide and conquer) * Modify method name to PascalCase(dynamic programming) * Modify method name to PascalCase(graph) * Modify method name to PascalCase(greedy) * Modify method name to PascalCase(hashing) * Modify method name to PascalCase(heap) * Modify method name to PascalCase(searching) * Modify method name to PascalCase(sorting) * Modify method name to PascalCase(stack and queue) * Modify method name to PascalCase(tree) * local check
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 {
|
||
/* 最大切分乘积:贪心 */
|
||
public 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);
|
||
}
|
||
} |