/**
* 减绳子
*
* 给你一根长度为n的绳子,请把绳子剪成整数长的m段(m、n都是整数,n>1并且m>1,m<=n),每段绳子的长度记为k[1],...,k[m]。
* 请问k[1]x...xk[m]可能的最大乘积是多少?例如,当绳子的长度是8时,我们把它剪成长度分别为2、3、3的三段,此时得到的最大乘积是18。
*
* 输入描述:输入一个数n,意义见题面。(2 <= n <= 60)
* 返回值描述:输出答案
*
* 示例1:
* 输入:8
* 输出:18
*/
public class JZ067CutRope {
/**
* 贪心算法
* @param target
* @return
*/
public int cutRope(int target) {
if (target < 2) {
return 0;
}
if (target == 2) {
return 1;
}
if (target == 3) {
return 2;
}
int timesOf3 = target / 3;
if (target - timesOf3 * 3 == 1) {
timesOf3--;
}
int timesOf2 = (target - timesOf3 * 3) / 2;
return (int) (Math.pow(3, timesOf3)) * (int) (Math.pow(2, timesOf2));
}
/**
* 动态规划
* @param target
* @return
*/
public int cutRope2(int target) {
if (target < 2) {
return 0;
}
if (target == 2) {
return 1;
}
if (target == 3) {
return 2;
}
int[] products = new int[target + 1];
products[0] = 0;
products[1] = 1;
products[2] = 2;
products[3] = 3;
int max = 0;
for (int i = 4; i <= target; i++) {
for (int j = 1; j <= i / 2; j++) {
int product = products[j] * products[i - j];
if (max < product) {
max = product;
}
}
products[i] = max;
}
return max;
}
}