96. Unique Binary Search Trees
2017-09-29 02:30
267 查看
public class Solution { public int numTrees(int n) { int[] dp=new int[n+1]; dp[0]=1; dp[1]=1; for(int i=2;i<=n;i++) for(int j=1;j<=i;j++) dp[i]+=dp[j-1]*dp[i-j]; return dp ; } }
相关文章推荐
- 96. Unique Binary Search Trees
- leetcode[96]:Unique Binary Search Trees
- leetcode 96: Unique Binary Search Trees
- leetcode96~Unique Binary Search Trees
- 96. Unique Binary Search Trees [转]
- 96. Unique Binary Search Trees
- [Leetcode] - 96 Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees Leetcode
- 96. Unique Binary Search Trees
- LeetCode 96:Unique Binary Search Trees
- Leetcode_96_Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- [LeetCode]: 96: Unique Binary Search Trees
- 96. Unique Binary Search Trees
- LeetCode 96: Unique Binary Search Trees
- [96]Unique Binary Search Trees
- 96. Unique Binary Search Trees
- leedcode做题总结, 题目Unique Binary Search TreesI/II95/96