[Leetcode] #96 Unique Binary Search Trees
来源:互联网 发布:协方差矩阵特征值分解 编辑:程序博客网 时间:2024/04/28 16:38
Discription:
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:
分别以1到n这n个数分别为根节点,求其二叉搜索树的个数,求其总和。对于每个根节点的二叉树的数目等于左子树的个数乘以右子树的数目,这里通过动态规划求出不同个数结点所构成二叉搜索树的数目并加以保存。
#include<iostream>#include<vector>using namespace std;int numTrees(int n) {vector<int> res;res.push_back(1);for (int i = 1; i <= n; i++){int num = 0;for (int j = 1; j <= i; j++){num += res[j - 1] * res[i - j];}res.push_back(num);}return res[n];}int main(){cout << numTrees(3) << endl;cin.get();return 0;}
0 0
- LeetCode 96 Unique Binary Search Trees II
- [leetcode 96] Unique Binary Search Trees
- Leetcode NO.96 Unique Binary Search Trees
- leetcode || 96、Unique Binary Search Trees
- [Leetcode 96, Medium] Unique Binary Search Trees
- leetcode-96 Unique Binary Search Trees
- Unique Binary Search Trees - LeetCode 96
- Leetcode 96 Unique Binary Search Trees
- Leetcode[96]-Unique Binary Search Trees
- Leetcode 96 Unique Binary Search Trees
- leetcode[96]:Unique Binary Search Trees
- [leetcode 96]Unique Binary Search Trees
- Leetcode # 96 Unique Binary Search Trees
- LeetCode(96) Unique Binary Search Trees
- [leetcode-96]Unique Binary Search Trees(c++)
- leetcode 96: Unique Binary Search Trees
- leetCode #96 Unique Binary Search Trees
- leetcode 95-96:Unique Binary Search Trees
- Android优秀三方框架
- 安装git,获取.ssh\id_rsa.pub
- Java类及其类成员的初始化(一)—类的初始化
- The Tomcat server configuration at \Servers\Tomcat v7.0 Server at localhost-config is missing. Check
- MVC(六、ActionResult 返回类型 )
- [Leetcode] #96 Unique Binary Search Trees
- 《阿里巴巴 Java 开发手册》
- 《java编程思想》读书笔记之——流程控制
- android studio配置git和github进行版本控制
- 致2017
- Java高效并发之乐观锁悲观锁、(互斥同步、非互斥同步)
- 关于SoftHashMap实现相关内容
- mysql学习之主从复制
- java基础学习总结—— 网络通信