LeetCode 154. 寻找旋转排序数组中的最小值 II
题目链接
思路分析
class Solution {
public:
int findMin(vector<int>& nums) {
std::ios::sync_with_stdio(false);
int l = 0, r = nums.size() - 1;
while(r > 0 && nums[r] == nums[0]) r--;
if(nums[r] >= nums[0]) return nums[0];
while(l < r){
int mid = l + r >> 1;
if(nums[mid] < nums[0]) r = mid;
else l = mid + 1;
}
return nums[l];
}
};