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
这题大牛思路如下:
设F(i , n)表示以i为root节点,长度为n的序列的BTS的个数;
设G(j)表示长度为j的序列的BTS的个数,这个个数跟从几开始没有关系,即{1,2,3,4}的BST的个数跟{4,5,6,7}的个数相同;
对于长度为n的序列,它的BTS的个数G(n) = F(1,n) + F(2,n) + F(3,n) +...+ F(n,n);
对于F(k , n)的值,可以看做是以k为root,分为两部分计算,左边是从1到k-1个节点的BTS,其个数用G(k - 1)表示,右边是从k+1到n个节点的BTS,其个数用G(n - k - 1)表示,所以F(k,n) = G(k - 1) * G(n - k - 1);
G(0) 1, G(1) = 1;
G(n) = G(0) * G(n - 1) + G(1) * G(n - 2) + ... + G(n - 2) * G(1) + G(n - 1) * G(0);
class Solution {
public:
int numTrees(int n) {
int G[n + 1] = {0};
G[0] = 1;
G[1] = 1;
for(int i = 2; i <= n; i ++){
for(int j = 0; j < i; j ++)
G[i] += G[j] * G[i - j - 1];
}
return G[n];
}
};