96. Unique Binary Search Trees
来源:互联网 发布:深信服广域网优化 编辑:程序博客网 时间:2024/06/03 19:57
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在top solution里有一篇很好的解释。
The problem can be solved in a dynamic programming way. I’ll explain the intuition and formulas in the following.
Given a sequence 1…n, to construct a Binary Search Tree (BST) out of the sequence, we could enumerate each number i in the sequence, and use the number as the root, naturally, the subsequence 1…(i-1) on its left side would lay on the left branch of the root, and similarly the right subsequence (i+1)…n lay on the right branch of the root. We then can construct the subtree from the subsequence recursively. Through the above approach, we could ensure that the BST that we construct are all unique, since they have unique roots.
The problem is to calculate the number of unique BST. To do so, we need to define two functions:
G(n)
: the number of unique BST for a sequence of length n.
F(i, n), 1 <= i <= n
: the number of unique BST, where the number i is the root of BST, and the sequence ranges from 1 to n.
As one can see, G(n)
is the actual function we need to calculate in order to solve the problem. And G(n)
can be derived from F(i, n)
, which at the end, would recursively refer to G(n)
.
First of all, given the above definitions, we can see that the total number of unique BST G(n)
, is the sum of BST F(i)
using each number i as a root.
i.e.
G(n) = F(1, n) + F(2, n) + ... + F(n, n).
Particularly, the bottom cases, there is only one combination to construct a BST out of a sequence of length 1 (only a root) or 0 (empty tree).
i.e.
G(0)=1, G(1)=1.
Given a sequence 1…n, we pick a number i out of the sequence as the root, then the number of unique BST with the specified root F(i)
, is the cartesian product of the number of BST for its left and right subtrees. For example, F(3, 7)
: the number of unique BST tree with number 3 as its root. To construct an unique BST out of the entire sequence [1, 2, 3, 4, 5, 6, 7] with 3 as the root, which is to say, we need to construct an unique BST out of its left subsequence [1, 2] and another BST out of the right subsequence [4, 5, 6, 7], and then combine them together (i.e. cartesian product). The tricky part is that we could consider the number of unique BST out of sequence [1,2] as G(2)
, and the number of of unique BST out of sequence [4, 5, 6, 7] as G(4)
. Therefore, F(3,7) = G(2) * G(4)
.
i.e.
F(i, n) = G(i-1) * G(n-i)1 <= i <= n
Combining the above two formulas, we obtain the recursive formula for G(n)
. i.e.
G(n) = G(0) * G(n-1) + G(1) * G(n-2) + … + G(n-1) * G(0)
In terms of calculation, we need to start with the lower number, since the value of G(n)
depends on the values of G(0) … G(n-1)
.
With the above explanation and formulas, here is the implementation in Java.
代码如下:public class Solution { public int numTrees(int n) { int[] G = new int[n + 1]; if (n == 0 || n == 1) { return 1; } 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]; }}
- 96.Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- linux 之 用户管理(新增用户与删除)
- 输出/输入重导向
- 基于MPU6050制作姿态控制外设
- Mysql 引擎介绍和选择
- 命令行执行R命令和R脚本
- 96. Unique Binary Search Trees
- 大型网站架构设计-Solr 网站设计笑话吸收之
- centos iptable端口转发 端口映射
- [Azure]ARM模式下没有公网IP地址的虚拟机如何与外部通信
- 操作系统实验六之多线程矩阵乘法
- Shell脚本编程的常识
- jQuery过滤选择器详解
- Minimum Inversion Number HDU
- LeetCode 15. 3Sum