96. Unique Binary Search Trees
来源:互联网 发布:淘宝自动生成手机详情 编辑:程序博客网 时间:2024/06/16 08:13
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
- /由1,2,3,...,n构建的二叉查找树,以i为根节点,左子树由[1,i-1]构成,其右子树由[i+1,n]构成。
- //定义f(i)为以[1,i]能产生的Unique Binary Search Tree的数目
- //若数组为空,则只有一种BST,即空树,f(0)=1;
- //若数组仅有一个元素1,则只有一种BST,单个节点,f(1)=1;
- //若数组有两个元素1,2,则有两种可能,f(2)=f(0)*f(1)+f(1)*f(0);
- //若数组有三个元素1,2,3,则有f(3)=f(0)*f(2)+f(1)*f(1)+f(2)*f(0)
- //由此可以得到递推公式:f(i)=f(0)*f(i-1)+...+f(k-1)*f(i-k)+...+f(i-1)*f(0)
- //利用一维动态规划来求解
- class Solution {public: int numTrees(int n) { vector<int> f(n+1,0); //n+1个int型元素,每个都初始化为0 f[0] = 1; f[1] = 1; for (int i = 2; i <= n; ++i){ for (int k = 1; k <= i; ++k) f[i] = f[i] + f[k - 1] * f[i - k]; } return f[n]; }};
阅读全文
0 0
- 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
- C#完成记事本功能,有用户名、密码输入、登陆、重置、自动换行、保存
- 机器学习使用案例解析源代码
- 树莓派3B的串口设置与简单调试
- windows本地sparkstreaming开发环境搭建及简单实例
- Summary of english in may
- 96. Unique Binary Search Trees
- RecyclerView系列(三)拖动排序,横滑删除
- 微信小程序学习第一天——page.json(配置)
- Wampserver主机服务配置方法
- POJ 1586 Three Sides Make a Triangle 笔记
- easybcd安装win10和Ubuntu双系统
- ubuntu安装
- Step7:material design的基本介绍以及安装
- Java网络爬虫--正则表达式之详解贪婪、逐步、独吐量词