题目链接:https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/
代码实现:
int findMin(vector<int>& nums) {
if(nums.size()==0) return -1 ;
int start = 0 , end = nums.size()-1 ;
int mid;
int target = nums[start]<nums[end]?nums[start]:nums[end];
while(start+1 < end){
mid = start + (end-start)/2;
if(nums[mid] < target){
if(nums[mid] > nums[end])
{start = mid ;}
else
{end = mid;}
}
else{
if(nums[mid] > nums[end])
{start = mid ;}
else{
end = mid ;
}
}
}
int temp = nums[start]<nums[end] ? nums[start]:nums[end];
target = target<temp ? target:temp;
return target;
}