[leetcode]Unique Binary Search Trees
2014-01-14 10:36
169 查看
catalan number
不过不懂怎么推导TAT
用递推来实现吧
不过不懂怎么推导TAT
用递推来实现吧
class Solution { public: int numTrees(int n) { vector<int> f(n+1 , 0); f[0] = 1; f[1] = 1; for(int i = 2 ; i <= n ; ++i) { for(int k = 1 ; k <= i ; ++k) { f[i] += f[k-1] * f[i-k]; } } return f ; } };
相关文章推荐
- Leetcode: 95. Unique Binary Search Trees II
- LeetCode解题报告—— Reverse Linked List II & Restore IP Addresses & Unique Binary Search Trees II
- 【LeetCode】Unique Binary Search Trees && II
- LeetCode: Unique Binary Search Trees II
- 【LeetCode】Unique Binary Search Trees I && II
- 【leetcode】【96】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 I,II
- [Leetcode] Unique Binary Search Trees
- LeetCode95 Unique Binary Search Trees II
- Leetcode: Unique Binary Search Trees II
- leetcode:Unique Binary Search Trees II
- Leetcode_95 Unique Binary Search Trees II
- 【Leetcode】Unique Binary Search Trees
- leetcode_c++:树: Unique Binary Search Trees(096)
- [LeetCode]Unique Binary Search Trees I&II
- LeetCode Unique Binary Search Trees