题目
题解
def search(nums: List[int], target: int) -> int:if not nums:return -1l, r = 0, len(nums) - 1while l <= r:mid = (l + r) // 2if nums[mid] == target:return mid# 注意判断左边升序的条件if nums[0] <= nums[mid]:# 注意判断的rangeif nums[0] <= target < nums[mid]:r = mid - 1else:l = mid + 1# 右边升序else:# 注意判断的rangeif nums[mid] < target <= nums[-1]:l = mid + 1else:r = mid - 1return -1
