题目1:【二刷完成】
class Solution {
public int integerBreak(int n) {
int[] dp =new int[n+1];
dp[0]=0;
dp[1]=0;
dp[2]=1;
for (int i=3;i<=n;i++){
for (int j=1;j<=i;j++){
dp[i]=Math.max(dp[i],Math.max(j*dp[i-j],j*(i-j)));
}
}
return dp[n];
}
}
题目2:【二刷完成】
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];
}
}