LeetCode--Unique Binary Search Trees
2017-11-11 17:17
405 查看
Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?
For example,
Given n = 3, there are a total of 5 unique BST’s.
思路:动态规划。
For example,
Given n = 3, there are a total of 5 unique BST’s.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3
思路:动态规划。
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 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 II
- Leetcode: Unique Binary Search Trees II
- LeetCode--Unique Binary Search Trees
- LeetCode(95) Unique Binary Search Trees II
- ***(leetcode)Unique Binary Search Trees II
- leetcode Unique Binary Search Trees II
- LeetCode | Unique Binary Search Trees II
- leetcode---Unique Binary Search Trees
- leetcode-Unique Binary Search Trees
- leetCode(26):Unique Binary Search Trees
- leetcode--Unique Binary Search Trees
- LeetCode: Unique Binary Search Trees I & II
- 【Leetcode】【python】Unique Binary Search Trees
- 【LeetCode】95. Unique Binary Search Trees II
- LeetCode 95. Unique Binary Search Trees II