这里因为含有重复数,每次旋转都可能
两段数组可能有相等的部分,就使用不了二分,这里我们可以把首位数字和结尾数字比较如果相同就删除,然后再用二分。
class Solution {
public:
bool search(vector<int>& nums, int target) {
if (nums.empty()) return false;
int R = nums.size() - 1;
while (R >= 0 && nums[R] == nums[0]) R -- ;
if (R < 0) return nums[0] == target;
int l = 0, r = R;
while (l < r) {
int mid = l + r + 1 >> 1;
if (nums[mid] >= nums[0]) l = mid;
else r = mid - 1;
}
if (target >= nums[0]) r = l, l = 0;
else l ++, r = R;
while (l < r) {
int mid = l + r >> 1;
if (nums[mid] >= target) r = mid;
else l = mid + 1;
}
return nums[r] == target;
}
};