Day41
数学方法
class Solution {
public int integerBreak(int n) {
if (n <= 3) return n - 1;
int res = 1;
while (n >= 5) {
res *= 3;
n -= 3;
}
return res * n;
}
}
动态规划
class Solution {
public int integerBreak(int n) {
int dp[] = new int[n + 1];
dp[2] = 1;
for (int i = 3; i <= n; i++) {
for (int j = 1; j < i - 1; j++) {
dp[i] = Math.max(dp[i],Math.max((i - j) * j, dp[i - j] * j));
}
}
return dp[n];
}
}
class Solution {
public int numTrees(int n) {
int dp[] = new int[n + 1];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= i; j++) {
dp[i] += dp[j - 1] * dp[i - j];
}
}
return dp[n];
}
}