1.整数拆分
. - 力扣(LeetCode)
思路:
class Solution {
public:
int integerBreak(int n) {
if(n <= 1) return n;
vector<int> dp(n + 1);
dp[2] = 1;
for(int i = 3;i <= n;i++){
for(int j = 1;j < i;j++){
dp[i] = max(dp[i],max((j * (i - j)),(j * dp[i - j])));
}
}
return dp[n];
}
};
2. 不同的二叉搜索树
. - 力扣(LeetCode)
class Solution {
public:
int numTrees(int n) {
vector<int> dp(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];
cout << dp[i]<<endl;
}
}
return dp[n];
}
};