153.Find Minimum in Rotated Sorted Array
Suppose an array sorted in ascending order 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.
You may assume no duplicate exists in the array.
给定一个数组,数组可能被旋转了,但是在旋转之前是递增有序的,找出该数组的的最小值。(数组没有重复值)
复杂度等价于一个二分查找,是O(logn),