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 = 0;j < i;j++){
dp[i] += dp[j] * dp[i-j-1];
}
}
return dp[n];
}
};
参考链接:
https://leetcode-cn.com/problems/unique-binary-search-trees/solution/96-bu-tong-de-er-cha-sou-suo-shu-python-uuysm/