343. 整数拆分
class Solution {
public:
int integerBreak(int n) {
if(n<=3) return n-1;
vector<int> dp(n+1, 0);
dp[1] = 1;
dp[2] = 2;
dp[3] =3;
for(int i=4; i<=n; i++)
{
dp[i] = max(dp[i-2]*2, dp[i-3]*3);
}
return dp[n];
}
};
96.不同的二叉搜索树
class Solution {
public:
int numTrees(int n) {
vector<int> dp(n+1, 0);
dp[0] = 1;
for(int i=1; i<=n;i++)
{
for(int j=0; j<i; j++)
{
dp[i] += dp[j]*dp[i-j-1];
}
}
return dp[n];
}
};