[Lintcode] 搜索旋转排序数组 II Search in Rotated Sorted Array II

跟进“搜索旋转排序数组”，假如有重复元素又将如何？

是否会影响运行时间复杂度？

如何影响？

为何会影响？

写出一个函数判断给定的目标值是否出现在数组中。

样例

给出[3,4,4,5,7,0,1,2]和target=4，返回 true

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 class Solution {
/**
* param A : an integer ratated sorted array and duplicates are allowed
* param target :  an integer to be search
* return : a boolean
*/
public boolean search(int[] A, int target) {
if(null == A || A.length == 0) return false;
return search(A, target, 0, A.length-1);
}

public boolean search(int[] A, int target, int l, int r) {
if(l > r) return false;
while(l<r && A[l] ==A[r]) {
l++;
}
int mid = (l + r)/2;
if(A[mid] == target) return true;
if(A[mid] >= A[l]) {
if(A[mid] >= target && A[l] <= target) {
return search(A, target, l, mid-1);
}else {
return search(A, target, mid+1, r);
}
}else{
if(A[mid] <= target && A[r] >= target) {
return search(A, target, mid+1, r);
}else{
return search(A, target, l, mid-1);
}
}
}
}