LeetCode 343. 整数拆分
class Solution {
public:
int dp[59];
int integerBreak(int n) {
dp[2] = 1;
for (int i = 3; i <= n; i++){
int index = 1;
int Max = INT_MIN;
while(index <= i / 2){
Max = max(Max, max(dp[i - index] *index,index *(i - index)));
index++;
}
dp[i] = Max;
}
return dp[n];
}
};
LeetCode 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];
}
};