【LeetCode】Unique Binary Search Trees
2014-11-14 11:52
323 查看
int numTrees(int n) { int i, k; vector<int> f(n + 1, 0); f[0] = 1; f[1] = 1; for (i = 2; i <= n; i++) { for (k = 1; k <=i; k++) { f[i] += f[k - 1] * f[i - k]; } } return f ; }
相关文章推荐
- [C++]LeetCode: 92 Unique Binary Search Trees II
- [leetcode]Unique Binary Search Trees II @ Python
- [Leetcode] Unique Binary Search Trees II
- LeetCode: Unique Binary Search Trees
- LeetCode: Unique Binary Search Trees II [096]
- LeetCode力扣之95. 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 2
- leetcode 96 c++. Unique Binary Search Trees
- LeetCode-Unique Binary Search Trees
- 【LeetCode】C# 96、Unique Binary Search Trees
- 【LeetCode】Unique Binary Search Trees
- 【Leetcode】【python】Unique Binary Search Trees
- 【LeetCode-面试算法经典-Java实现】【096-Unique Binary Search Trees(唯一二叉搜索树)】
- [C++]LeetCode: 53 Unique Binary Search Trees
- LeetCode | Unique Binary Search Trees II(构建二叉搜索树)
- [LeetCode] Unique Binary Search Trees
- LeetCode Unique Binary Search Trees II