LeetCode-96. 不同的二叉搜索树

地址：https://leetcode-cn.com/problems/unique-binary-search-trees/
思路：
一：dp
f(i): 以 i 为根的二叉搜索树个数
s(n): n个节点的二叉搜索树个数
s(n)=f(1) + f(2) + … + f(n)
f(i) = s(i-1)*s(n-i)
则s(n) = s(0)*s(n-1) + s(1)*s(n-2) + … + s(n-1)*s(0);

二：卡特兰数
s(n) = s(0)s(n-1) + s(1)s(n-2) + … + s(n-1)s(0);
即为卡特兰数 s(n) = C(2n,n)/(n+1) = C(2n,n) - C(2n,n-1)
s(n+1) = 2*(2*n+1)/(n+2)*s(n)

Code1:

class Solution {
public:
    int numTrees(int n) {
        vector<int> s(n+1,0);
        s[0]=s[1]=1;
        for(int i=2;i<=n;++i)
        	for(int j=i;j<=i;++j)
        		s[i]+=s[j-1]*s[i-j];
        return s[n];
    }
};

Code2:

class Solution {
public:
    int numTrees(int n) {
        long long s=1;
        for(int i=0;i<n;++i)
        	s=s*2*(2*i+1)/(i+2);
        return (int)s;
    }
};