2023-07-21 21:56:14 +08:00
|
|
|
|
/**
|
|
|
|
|
* File: max_product_cutting.java
|
|
|
|
|
* Created Time: 2023-07-21
|
2024-02-07 22:21:18 +08:00
|
|
|
|
* Author: krahets (krahets@163.com)
|
2023-07-21 21:56:14 +08:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
package chapter_greedy;
|
|
|
|
|
|
|
|
|
|
import java.lang.Math;
|
|
|
|
|
|
|
|
|
|
public class max_product_cutting {
|
|
|
|
|
/* 最大切分乘积:贪心 */
|
|
|
|
|
public static 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);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public static void main(String[] args) {
|
|
|
|
|
int n = 58;
|
|
|
|
|
|
|
|
|
|
// 贪心算法
|
|
|
|
|
int res = maxProductCutting(n);
|
2023-07-24 03:05:57 +08:00
|
|
|
|
System.out.println("最大切分乘积为 " + res);
|
2023-07-21 21:56:14 +08:00
|
|
|
|
}
|
|
|
|
|
}
|