LeetCode OJ Unique Binary Search Trees
2015-03-22 18:59
239 查看
class Solution { public: Solution() { for (int i = 0; i < 100; ans[i++] = 0); ans[0] = ans[1] = 1; } int numTrees(int n) { return cal(n); } int cal(int n) { if (ans ) return ans ; for (int i = 0; i < n; i++) { ans += cal(i) * cal(n - 1 - i); } return ans ; } int ans[100]; };
相关文章推荐
- leetcode OJ Unique Binary Search Trees
- LeetCode OJ Unique Binary Search Trees II
- leetcode---Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- leetcode -- Unique Binary Search Trees II
- LeetCode: Unique Binary Search Trees
- 算法作业HW13:Leetcode96 Unique Binary Search Trees
- leetcode -- Unique Binary Search Trees II
- LeetCode —— Unique Binary Search Trees II
- Leetcode-unique-binary-search-trees
- [leetcode 95] Unique Binary Search Trees II
- LeetCode | Unique Binary Search Trees
- LeetCode 95. Unique Binary Search Trees II
- leetcode || 95、Unique Binary Search Trees II
- Leetcode: Unique Binary Search Trees
- Leetcode:Unique Binary Search Trees
- [C++]LeetCode: 92 Unique Binary Search Trees II
- Leetcode-Unique Binary Search Trees
- [Leetcode]Unique Binary Search Trees
- Unique Binary Search Trees (leetcode)