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.
旋转之后的数组大小如上图所示。
有两种情况:
1、nums[mid]>nums[high]>nums[low]
这表明mid在前半段,mid=high
2、nums[high]>nums[low]>nums[low]
mid=low
public class Solution {
public int findMin(int[] nums) {
if(nums.length==1)
return nums[0];
int high=0;
int low=nums.length-1;
int mid=(high+low)/2;
if(nums[high]<nums[low])
return nums[high];
while(high<low){
if(nums[mid]>nums[high]){
high=mid;
}
else{
low=mid;
}
mid=(high+low)/2;
}
return nums[high+1];
}
}