【LeetCode从零单排】No96Unique Binary Search Trees
来源:互联网 发布:手机排队软件 编辑:程序博客网 时间:2024/05/21 22:23
题目
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.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3百度这个说的挺好:点击打开链接
代码
public class Solution { public int numTrees(int n) { int [] G = new int[n+1]; G[0] = G[1] = 1; for(int i=2; i<=n; ++i) { for(int j=1; j<=i; ++j) { G[i] += G[j-1] * G[i-j]; } } return G[n];}}
代码下载:https://github.com/jimenbian/GarvinLeetCode
/********************************
* 本文来自博客 “李博Garvin“
* 转载请标明出处:http://blog.csdn.net/buptgshengod
******************************************/
0 0
- 【LeetCode从零单排】No96Unique Binary Search Trees
- 【LeetCode从零单排】No102 Binary Tree Level Order Traversal
- 【LeetCode从零单排】No104 Maximum Depth of Binary Tree
- 【LeetCode从零单刷】Unique Binary Search Trees I & II
- LeetCode: Unique Binary Search Trees
- LeetCode : Unique Binary Search Trees
- [Leetcode] Unique Binary Search Trees
- [LeetCode]Unique Binary Search Trees
- LeetCode Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- LeetCode-Unique Binary Search Trees
- [leetcode] Unique Binary Search Trees
- LeetCode - Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- 【Leetcode】Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- 【LeetCode】Unique Binary Search Trees
- Leetcode Unique Binary Search Trees
- 关于正则表达式
- jquery实现显示与隐藏的几种方式:
- web.xml 中的listener、 filter、servlet 加载顺序及其详解
- 10大类逻辑关系
- VS2010引用App_Code下的类文件问题解决方法
- 【LeetCode从零单排】No96Unique Binary Search Trees
- C++中容易忽略的一些细节
- 小应用大智慧学习笔记
- Android自定义圆形图片 带边框效果
- jni 与java 之间传递bytearray
- SublimeText3: ImportError: No module named ‘urllib2′
- Android对Linux内核的改动你知道多少?
- C++ 类里面,函数占用存储空间问题
- 网页中嵌入外部页面的四种方法