------
## 最终结论
```python
def search(nums, target):
    left, right = 0, len(nums) - 1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] == target:
            return True

        if nums[left] == nums[mid] == nums[right]:
            left += 1
            continue

        if nums[left] <= nums[mid]:  # Left part is sorted
            if nums[left] <= target < nums[mid]:  # Target is in the left part
                right = mid - 1
            else:  # Target is not in the left part
                left = mid + 1
        else:  # Right part is sorted
            if nums[mid] < target <= nums[right]:  # Target is in the right part
                left = mid + 1
            else:  # Target is not in the right part
                right = mid - 1

    return False

# Example usage:
nums1 = [2,5,6,0,0,1,2]
target1 = 0
print(search(nums1, target1)) # Output: True

nums2 = [2,5,6,0,0,1,2]
target2 = 3
print(search(nums2, target2)) # Output: False
```