这个题如果想到,一个整数的拆解出的乘积最大,取决于这个整数拆解出的整数的乘积最大就可以想到用动态规划来做了
public int integerBreak(int n) {
int [] dp = new int[n+1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++){
int max = Integer.MIN_VALUE;
for (int j = 1; j < i; j++){
max = Math.max(Math.max(j * (i-j), j * dp[i-j]),max);
}
dp[i] = max;
}
return dp[n];
}
public int integerBreak(int n) {
if (n < 4) {
return n - 1;
}
int[] dp = new int[n + 1];
dp[2] = 1;
for (int i = 3; i <= n; i++) {
dp[i] = Math.max(Math.max(2 * (i - 2), 2 * dp[i - 2]), Math.max(3 * (i - 3), 3 * dp[i - 3]));
}
return dp[n];
}
class Solution {
public int integerBreak(int n) {
if (n <= 3) {
return n - 1;
}
int quotient = n / 3;
int remainder = n % 3;
if (remainder == 0) {
return (int) Math.pow(3, quotient);
} else if (remainder == 1) {
return (int) Math.pow(3, quotient - 1) * 4;
} else {
return (int) Math.pow(3, quotient) * 2;
}
}
}