搜索旋转排序数组

def solve():
    def search(____):
        left, right = ____, len(____) - ____
        while left <= right:
            mid = (____) // ____
            if nums[mid] == target:
                return mid
            if nums[left] <= nums[mid]:
                if nums[left] <= target < nums[mid]:
                    right = mid - ____
                else:
                    left = mid + ____
            else:
                if nums[mid] < target <= nums[right]:
                    left = mid + ____
                else:
                    right = mid - ____
        return -____
    print(search(____))