标签：
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.
You may assume no duplicate exists in the array.
Find Minimum in Rotated Sorted Array
标签：
原文地址：http://www.cnblogs.com/sherylwang/p/5496571.html
