题目
官方题解
代码(首刷看解析)
更像是数学,感觉自己怎么推也推理不出来
G ( n ) = ∑ i = 1 n G ( i − 1 ) ⋅ G ( n − i ) G(n)=\sum_{i=1}^{n} G(i-1) \cdot G(n-i) G(n)=∑i=1nG(i−1)⋅G(n−i)
class Solution {
public:
int numTrees(int n) {
if(n == 1)
return 1;
vector<int> dp(n+1);
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i <= n; i++) {
for(int j = 1; j <= i; j++) {
dp[i] += dp[j-1]*dp[i-j];
}
}
return dp[n];
}
};
代码(9.21 二刷自解)
class Solution {
public:
vector<vector<int>> memo;
int numTrees(int n) {
memo = vector<vector<int>>(20, vector<int>(20));
return build(1, n);
}
int build(int l, int r) {
if(l > r) {
return 1;
}
if(memo[l][r] != 0)
return memo[l][r];
int sum = 0;
for(int i = l; i <= r; i++) {
int leftTree = build(l, i-1);
int rightTree = build(i+1, r);
sum += leftTree*rightTree;
}
memo[l][r] = sum;
return sum;
}
};