def search(self, A, target):
        low, high = 0, len(A)
        
        while low < high:
            mid = low + (high - low) / 2
            
            if A[mid] == target:
                return True
            
            if A[low] < A[mid]:
                if A[low] <= target or target < A[mid]:
                    high = mid
                else:
                    low = mid + 1
            elif A[low] > A[mid]:
                if A[mid] < target and target <= A[high - 1]:
                    low = mid + 1
                else:
                    high = mid
            else:
                low += 1
                
        return False
dataset/ETHPy150Open kamyu104/LeetCode/Python/search-in-rotated-sorted-array-ii.py/Solution.search/operator `and` -> `or`