81. Search in Rotated Sorted Array II

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.

Subscribe to see which companies asked this question

public class Solution {
public boolean search(int[] nums, int target) {
int a = 0,c = nums.length-1;
while(a<=c){
int b = (a+c)>>1;
if(nums[b]==target)return true;
if(nums[a]==nums[b]&&nums[a]==nums[c]){
a++;
c--;
}else if(nums[a]<=nums[b]){
if(nums[a]<=target&&target<nums[b]){
c=b-1;
}else{
a=b+1;
}
}else{
if(nums[b]<target&&target<=nums[c]){
a=b+1;
}else{
c=b-1;
}
}
}
return false;
}
}