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 7 might become 4 5 6 7 0 1 2). Find the minimum element. 阅读全文
posted @ 2015-03-08 12:11 IncredibleThings 阅读(97) 评论(0) 推荐(0) 编辑