Unique Binary Search Tree -- LeetCode
来源:互联网 发布:教育培训网络推广方案 编辑:程序博客网 时间:2024/05/23 22:18
题目:
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
#include <iostream>#include <vector>using namespace std;/* 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.*/ /*查找一个序列中搜索二叉树的种类 其实对于一个序列来说 任何一个值都可以成为二叉树的根节点 依据这一特性可以判断出一个二叉树的种类数目 那么依据任何一个节点为根 等于左子树种类乘以右子树的种类 */int NumofBinaryTree(int n){vector<int> vec(n+1,0);vec[0]=1;vec[1] =1;if(n<0)return 0;int i,k;for(i=2;i<vec.size();i++){for(k=0;k<i;k++)vec[i] += vec[k]*vec[i-k-1];}return vec[n];}int main() {cout<<NumofBinaryTree(3);return 0;}
0 0
- [LeetCode] Unique Binary Search Tree
- LeetCode : Unique Binary Search Tree
- 【LeetCode】Unique Binary Search Tree
- [Leetcode]Unique binary search tree
- Unique Binary Search Tree -- LeetCode
- Leetcode: Unique Binary Search Tree II
- LeetCode 96: Unique Binary Search Tree
- Leetcode - Tree /Dynamic Programming- Unique Binary Search
- Leetcode练习- Unique Binary Search Tree
- leetcode java unique binary search tree
- 【Leetcode】Unique Binary Search Tree II (DP)
- 【Leetcode】Unique Binary Search Tree in JAVA
- leetcode-unique binary search tree II
- Unique Binary Search Tree II -LeetCode
- [leetcode][tree] Unique Binary Search Trees
- [leetcode][tree] Unique Binary Search Trees II
- leetCode 96:Unique Binary Search Tree
- LeetCode #96 Unique Binary Search Tree
- 对一个程序的思考4(结构体内存对齐)
- H264--5--H264解码
- 盛希泰、俞敏洪:天使投资只看团队?这是瞎扯,肯定不够!
- 手把手教你把Vim改装成一个IDE编程环境(图文)
- CentOS下安装blue box
- Unique Binary Search Tree -- LeetCode
- leetcode: Compare Version Numbers
- 安装oracle
- 【AHOI 2013】【BZOJ 3236】作业
- 51单片机万年历
- ASCII 转 二进制码 in C
- C++ Primer 第五版中的Sales_data类---用来模拟Sales_item类的实现
- SAP Query 小结
- 反射投影直方图以检测待定的图像内容