class Solution {
public:
int numTrees(int n) {
vector<int> dp(n + 1);
dp[0] = 1;
//节点总数i
for (int i = 1; i <= n; i++) {
//根节点值为j
for (int j = 1; j <= i; j++) {
dp[i] += dp[j - 1] * dp[i - j];
}
}
return dp[n];
}
};
LeetCode96.不同的二叉搜索树
最新推荐文章于 2024-08-10 07:14:43 发布