343. 整数拆分
尽可能拆成相同的数
dp数组含义:拆得最大积为dp[i]
递推公式:dp[i] = max(dp[i], max((i - j) * j, dp[i - j] * j));
初始化:dp[2]=1
遍历顺序:从前往后遍历
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((i - j) * j, dp[i - j] * j));
}
}
return dp[n];
}
};
96.不同的二叉搜索树
dp数组含义:有dp[n]种不同的二叉树
递推公式:dp[i] += dp[j - 1] * dp[i - j]
初始化:dp[0]=1
遍历顺序:从小到大
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];
}
};