Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?
Example:
Input: 3
Output: 5
Explanation:
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
给出数字n,问从1到n的这n个点,可以组成多少个binary search tree
二叉搜索树条件:左子树 < root < 右子树
思路:
dynamic programming
定义dp数组treeNum[n+1]
n = 1时,一个节点是1个BST,即treeNum[1] = 1
n = 2时,节点是1,2
顺序假设1,2是root:
1作root时,左子树是0个节点,右子树是{2},即1个节点
那么BST的总数量应该是左子树的数量 * 右子树数量(可以画出来)
treeNum[2] = treeNum[0] * treeNum[1]
而已经知道treeNum[1] = 1
左边是0个节点相当于所有剩余节点都在右子树,只需要知道右子树的数量就行了,
即1为root时, treeNum[2] = treeNum[1],
但是为了利用treeNum[2] = treeNum[0] * treeNum[1] = 1
定义treeNum[0] = 1
当2为root时,左子树一个节点{1}, 右边0个节点, 和之前的一种情况相加
所以treeNum[2] += treeNum[1] * treeNum[0] = 2
以此类推
3个节点时:1,2,3
1为root:左子树0个节点,右子树{ 2, 3}
treeNum[3] += treeNum[0] * treeNum[2]
2为root:
treeNum[3] += treeNum[1] * treeNum[1]
3为root:
treeNum[3] += treeNum[2] * treeNum[0] = 5
为了求n个节点有多少个BST,需要顺序求出2~n-1个节点有多少个BST
假设i是从2~n-1
对某个 i,需要从左到右假设每个点 j 是root
看 j 左边有几个节点作为左子树,右边有几个节点作为右子树
即treeNum[j] = treeNum[j] * treeNum[i - j - 1]
public int numTrees(int n) {
if (n <= 1) {
return n;
}
int[] treeNum = new int[n + 1];
treeNum[0] = 1;
treeNum[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < i; j++) {
treeNum[i] += treeNum[j] * treeNum[i - j - 1];
}
}
return treeNum[n];
}