Fork me on GitHub
2017年6月17日
[leetcode-95-Unique Binary Search Trees II]
摘要： Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文
posted @ 2017-06-17 21:44 hellowOOOrld 阅读(150) 评论(0) 推荐(0) 编辑
[leetcode-96-Unique Binary Search Trees]
摘要： 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' 阅读全文
posted @ 2017-06-17 19:02 hellowOOOrld 阅读(157) 评论(0) 推荐(0) 编辑