代码随想录算法打卡第三十五天, 新手自我记录一下刷题历程, 仅为自我打卡使用.
343. 整数拆分
class Solution {
public:
int integerBreak(int n) {
vector<int> dp(n + 1, 0);
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 * dp[i - j], j * (i - j)));
}
}
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 - 1 - j];
}
}
return dp[n];
}
};
希望还能再坚持一天!