问题:链接
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
For example,
Given n = 3, there are a total of 5 unique BST's.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3解答;
利用递归,不同树的个数,等于左右子树不同个数相加,左右子树的不同个数 等于左子树不同的个数乘以右子树不同的个数。
代码:
class Solution {
public:
int numTrees(int n) {
if(n == 0 || n == 1)
{
return 1;
}
int sum = 0;
for(int i = 0; i < n; i++)
{
sum += numTrees(i)*numTrees(n-1-i);
}
return sum;
}
};