[LeetCode] Unique Binary Search Trees
2014-11-02 16:30
501 查看
class Solution { public: int numTrees(int n) { int * v = new int[n + 1]; v[0] = 1; v[1] = 1; v[2] = 2; for(int i = 3;i <= n;i ++){ v[i] = 0;//一定要初始化下!!! for(int j = 0;j < i;j ++) v[i] += v[j]*v[i - j - 1]; } return v ; } };
相关文章推荐
- LeetCode Unique Binary Search Trees
- LeetCode 95: Unique Binary Search Trees II
- [Leetcode] Unique Binary Search Trees II (Java)
- Unique Binary Search Trees II -- LeetCode
- [Leetcode] Unique Binary Search Trees
- leetcode JAVA Unique Binary Search Trees 难度系数3 3.34
- LeetCode No.95 Unique Binary Search Trees II
- 【LeetCode】Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- leetcode - Unique Binary Search Trees II
- leetcode 95&96. Unique Binary Search Trees
- [C++]LeetCode: 92 Unique Binary Search Trees II
- Leetcode 树 Unique Binary Search Trees
- Leetcode 树 Unique Binary Search TreesII
- Unique Binary Search Trees [LEETCODE]
- [Leetcode] Unique Binary Search Trees II
- LeetCode 096 Unique Binary Search Trees
- (leetcode )Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- leetcode Unique Binary Search Trees II