leetcode---Unique Binary Search Trees
2015-03-20 20:56
267 查看
二分查找树的特点:左边结点的必须比根结点小,右边结点的必须比根结点大。
代码如下:
代码如下:
class Solution { public: int numTrees(int n) { //dp[i] = sigma(dp[0...k] * dp[k+1...i]) 0 <= k < i - 1; //递推出来的,从n=0开始,然后n=1,n=2等等 int f[n+1]; memset(f,0,sizeof(int)*(n+1)); f[0]=1; for(int i=1;i<n+1;i++) { for(int j=0;j<i;j++) { f[i]+=f[j]*f[i-j-1]; } } return f ; } };
相关文章推荐
- LeetCode: Unique Binary Search Trees II
- LeetCode 95. Unique Binary Search Trees II
- LeetCode - 96/95 - Unique Binary Search Trees
- LeetCode题解——Unique Binary Search Trees
- [leetcode][tree] Unique Binary Search Trees
- Unique Binary Search Trees - LeetCode
- LeetCode: Unique Binary Search Trees
- LeetCode "Unique Binary Search Trees"
- LeetCode95 Unique Binary Search Trees II
- Leetcode: Unique Binary Search Trees
- leetcode - Unique Binary Search Trees
- LeetCode题解:Unique Binary Search Trees
- leetcode-Unique Binary Search Trees II
- 【LeetCode】Unique Binary Search Trees 二叉查找树的个数
- LeetCode——Unique Binary Search Trees
- leetcode--Unique Binary Search Trees II
- LeetCode *** 95. Unique Binary Search Trees II
- [LeetCode] Unique Binary Search Trees II
- 【Leetcode】Unique Binary Search Trees II
- Leetcode[96]-Unique Binary Search Trees