首页 > 代码库 > leetcode-Unique Binary Search Trees
leetcode-Unique Binary Search Trees
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; } };
leetcode-Unique Binary Search Trees
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。