2015年3月11日

LeetCode-95 Unique Binary Search Trees II

摘要： Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文

posted @ 2015-03-11 22:23 linxiong1991 阅读(100) 评论(0) 推荐(0) 编辑

LeetCode-154 Find Minimum in Rotated Sorted Array II

摘要： Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Suppose a sort... 阅读全文

posted @ 2015-03-11 18:29 linxiong1991 阅读(123) 评论(0) 推荐(0) 编辑

导航