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.
class Solution {
public:
int findMin(vector<int>& nums) {
return dfs(nums,,nums.size()-);
}
int dfs(vector<int>& nums, int start, int end){
if(start==end) return nums[start];
int mid = start + ((end - start) >> );
if(nums[start] <= nums[mid] && nums[mid] < nums[end]){ //no rotate
return nums[start];
}
else if(nums[start] <= nums[mid] && nums[mid] > nums[end]){ //rotate in the right
return dfs(nums, mid+,end);
}
else{ //rorate in the left
return dfs(nums, start, mid);
}
}
};