代码随想录算法训练营第四十天| 343. 整数拆分、96.不同的二叉搜索树
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 / 2; j++) {
dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]));
}
}
return dp[n];
}
};
96.不同的二叉搜索树
题目链接
文章讲解
class Solution {
public:
int numTrees(int n) {
if (n <= 2) return n;
vector<int> dp(n + 1, 0);
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];
}
};