LeetCode-Unique Binary Search Trees
2013-08-12 20:35
351 查看
class Solution { public: int numTrees(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 0 || n == 1) { return 1; } vector<int> num(n + 1, 0); num[0] = 1; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= i - 1; ++j) { num[i] += num[j] * num[i - j - 1]; } } int ans = num ; return ans; } };
相关文章推荐
- LeetCode——Unique Binary Search Trees II
- [LeetCode] Unique Binary Search Trees II (难以忍受的递归)
- 【leetcode刷题笔记】Unique Binary Search Trees
- LeetCode 之 Unique Binary Search Trees
- [LeetCode]Unique Binary Search Trees, 解题报告
- leetcode96~Unique Binary Search Trees
- [leetcode-95]Unique Binary Search Trees II(c++)
- [LeetCode][JavaScript]Unique Binary Search Trees II
- LeetCode | Unique Binary Search Trees
- Unique Binary Search Trees II - LeetCode
- [LeetCode] Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- LeetCode - Unique Binary Search Trees
- LeetCode - Unique Binary Search Trees II
- Unique Binary Search Trees (leetcode) 动态规划
- [Leetcode]Unique Binary Search Trees II
- leetcode || 96、Unique Binary Search Trees
- LeetCode Unique Binary Search Trees
- LeetCode No.95 Unique Binary Search Trees II
- LeetCode 57 Unique Binary Search Trees