原题链接:81. 搜索旋转排序数组 II
solution:
二分
① 首先找到不满足非降序的下标
② 确定二分的区间
③ 实现二分查找
class Solution {
public:
bool search(vector<int>& nums, int target) {
int n = nums.size(); //数组元素
int index; //找到第一个非降序下标
for(index = 0;index < n;index++) {
if(index > 0 && nums[index] < nums[index - 1]) break;
}
//确定二分区间
int left,right;
if(index < n && target >= nums[index] && target <= nums[n - 1]) left = index,right = n - 1;
else left = 0,right = index - 1;
while(left < right) {
int mid = left + (right - left) / 2;
if(nums[mid] >= target) right = mid;
else left = mid + 1;
}
if(nums[left] != target) return false;
return true;
}
};