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