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.
public boolean search(int[] A, int target) {
if(A==null || A.length==0)
return false;
int l = 0;
int r = A.length-1;
while(l<=r)
{
int m = (l+r)/2;
if(A[m]==target)
return true;
if(A[m]>A[l])
{
if(A[m]>target && A[l]<=target)
{
r = m-1;
}
else
{
l = m+1;
}
}
else if(A[m] { if(A[m] { l = m+1; } else { r = m-1; } } else { l++; } } return false; }
