Description:
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————————————————————————————————————————————————————————————————————————————
Solution:
每棵树能分成两部分:G(n)代表包含n个连续数字序列能组成的独特二叉搜索树个数。F(i,n)代表根是i的包含n个连续数字序列的独特二叉搜索树个数。
class Solution {
public:
int numTrees(int n) {
// G(n) = F(1,n) + F(2,n) + ... + F(n,n)
// F(i,n) = G(i-1) * G(n-i)
// G(0) = G(1) = 1
vector<int> G(n + 1, 0);
G[0] = G[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= i; j++) {
G[i] += G[j - 1] * G[i - j];
}
}
return G[n];
}
};