代码随想录第40天
343. 整数拆分
class Solution {
public:
int integerBreak(int n) {
vector<int> dp(n+1,0);
dp[2] = 1;
for(int i = 3; i <= n; i++){
for(int j = 1; j < i; j++){
int tmp = max((i-j)*j,dp[i-j]*j);
dp[i] = max(dp[i],tmp);
}
}
return dp[n];
}
};
96. 不同的二叉搜索树
class Solution {
public:
int numTrees(int n) {
if(n <= 1) return 1;
vector<int> dp(n+1,0);
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];
}
};