2014年10月17日
LeetCode Permutations
摘要： Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,... 阅读全文
posted @ 2014-10-17 23:24 birdhack 阅读(107) 评论(0) 推荐(0)
LeetCode Find Minimum in Rotated Sorted Array
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2014-10-17 21:26 birdhack 阅读(88) 评论(0) 推荐(0)