题目:
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我的解法:
(1)算法思想:
问题的结果是卡特兰数,(2*n,n)/(n+1)
(2)代码如下:
class Solution {
public:
int numTrees(int n) {
long result=1;
for(int i=1;i<=n;i++){
result=result*(i+n)/i;
}
result/=(n+1);
return result;
}
};