classSolution{public:
vector<int>searchRange(vector<int>& nums,int target){int left =0, right = nums.size()-1;
vector<int> res;while(left <= right){int mid = left +((right - left)>>1);if(nums[mid]> target) right = mid -1;elseif(nums[mid]< target) left = mid +1;else{int m = mid, n = mid;int temp = nums[mid];while(m >=0&& nums[m]== temp){
m--;}
res.push_back(m+1);while(n < nums.size()&& nums[n]== temp){
n++;}
res.push_back(n -1);break;}}if(res.size()==0)return{-1,-1};elsereturn res;}};
153. 寻找旋转排序数组中的最小值
classSolution{public:intfindMin(vector<int>& nums){int left =0, right = nums.size()-1;while(left < right){int mid = left +((right - left)>>1);if(nums[mid]> nums[right]){
left = mid +1;}else{
right = mid;}}return nums[left];}};