343. 整数拆分
题目:力扣
class Solution {
public:
int integerBreak(int 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(dp[i-j]*j,(i-j)*j));
}
}
return dp[n];
}
};
96.不同的二叉搜索树
题目:力扣
class Solution {
public:
int numTrees(int n) {
vector<int> dp(n+1);
dp[0] = 1;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= i; ++j){
dp[i] += dp[j - 1] * dp[i - j];
}
}
return dp[n];
}
};
总结
题型:动态规划
技巧:找规律两层循环