343. 整数拆分
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/2;j++){
dp[i] = Math.max(dp[i], Math.max(j*dp[i-j], j*(i-j)));
}
}
return dp[n];
}
}
96.不同的二叉搜索树
class Solution {
public int numTrees(int n) {
if(n<=2) return n;
int[] dp= new int[n+1];
dp[0]=1;
dp[1]=1;
dp[2]=2;
for(int i=3;i<=n;i++){
for(int j=1;j<=i;j++){
dp[i]+=dp[j-1]*dp[i-j];
}
}
return dp[n];
}
}