leetcode-Unique Binary Search Trees
来源:互联网 发布:破解今日头条算法推荐 编辑:程序博客网 时间:2024/06/07 23:33
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.
去网上搜n个二叉搜索树的递推公式或者Catalan数,可以由h(n)=C(2n,n)/(n+1)得到h(n)=[2n*(2n-1)*...(n+2)]/[n!].
class Solution {public: int numTrees(int n) { long long facN=1,fac2N=1; for(long long i=1;i<=n;i++) facN*=i; for(long long i=n+2;i<=2*n;i++) fac2N*=i; long long res=fac2N/facN; return res; }};
0 0
- LeetCode: Unique Binary Search Trees
- LeetCode : Unique Binary Search Trees
- [Leetcode] Unique Binary Search Trees
- [LeetCode]Unique Binary Search Trees
- LeetCode Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- LeetCode-Unique Binary Search Trees
- [leetcode] Unique Binary Search Trees
- LeetCode - Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- 【Leetcode】Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- 【LeetCode】Unique Binary Search Trees
- Leetcode Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- LeetCode | Unique Binary Search Trees
- 老公关机了还可以定位吗?QQ1622863529
- 不懂密码怎么登录儿子的QQ?QQ1622863529
- 儿子上课逃学怎么定位他的手机?QQ1622863529
- iOS8使用TestFlight进行内部测试功能尝鲜
- AndroidAnnotations使用说明书—AndroidAnnotations是如何工作的?
- leetcode-Unique Binary Search Trees
- 没有别人的微信密码怎么查看的聊天记录?QQ1622863529
- IT新贵:网络安全工程师
- Qt中序列化自定义对象
- 不懂男友的QQ密码怎么登录他的QQ?QQ1622863529
- 关于LoadRunner的迭代
- JS日期控件
- 不懂别人的微信密码,想登录怎么办?QQ1622863529
- MySQL索引背后的数据结构及算法原理