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.
解题思路：
本题和Java for LeetCode 033 Search in Rotated Sorted Array题有点像，修改下代码即可，JAVA实现如下：
public int findMin(int[] nums) {
int left = 0, right = nums.length - 1;
while (left < right && nums[right] < nums[left]) {
if (nums[(right + left) / 2] == nums[left])
return Math.min(nums[left], nums[right]);
else if (nums[(right + left) / 2] > nums[left])
left = (right + left) / 2;
else
right = (right + left) / 2;
}
return nums[left];
}
Java for LeetCode 153 Find Minimum in Rotated Sorted Array
原文：http://www.cnblogs.com/tonyluis/p/4554969.html