解决旋转数组二分查找的万能程序

class Solution {
public:
bool search(int A[], int n, int target) {
int low = 0, high = n - 1;
while(low <= high){
int mid = low + ((high - low) >> 1);
if(A[mid] == target){
return true;
}
if(A[low] == A[mid] && A[mid] == A[high]){
low++;
high--;
continue;
}
if(A[low] <= A[mid]){//mid的左边有序
if(A[low] <= target && target < A[mid]){//目标数确定在mid的左半边
high = mid - 1;
}else{
low = mid + 1;
}
}else{//mid的右边有序
if(A[mid] < target && target <= A[high]){//目标数确定在mid的右半边

low = mid + 1;
}else{
high = mid - 1;
}
}
}
return false;
}
};