Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
仍然是二分查找的考查,需要考虑到重复元素的出现,其他的情况和正常的一样,代码如下:
class Solution {
public:
bool search(vector<int>& nums, int target) {
int low=0,high=nums.size()-1;
while(low<=high){
int mid=(low+high)/2;
if(nums[mid]==target) return true;
if(nums[mid]>nums[high]){
if(nums[mid]<target||target<=nums[high])
low=mid+1;
else
high=mid;
}else if(nums[mid]<nums[high]){
if(nums[mid]<target&&target<=nums[high])
low=mid+1;
else
high=mid;
}else{
high--;
}
}
return nums[low]==target?true:false;
}
};