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.
解题思路: 二分法分三种情况,l 、r 为数组最左和最右index
1、当nums[mid] < nums[r], 最小值出现在l - mid
2、当nums[mid] > nums[r]且nums[l] != nums[mid], 最小值出现在 mid - r;
3、当nums[mid] == nums[r],则最小值出现在l、r两者之间
int findMin(vector<int>& nums) {
int l = 0, r = nums.size()-1, mid;
while(l < r) {
mid = (l + r)/2;
if(nums[mid] < nums[r]) {
r = mid;
} else if (nums[r] < nums[mid] && nums[l] != nums[mid]){
l = mid;
} else {
// 设置退出机制
nums[l] < nums[r]? r--:l++;
}
}
return nums[l];
}