搜索旋转排序数组
class Solution:
def search(self, nums: List[int], target: int) -> int:
p_left,p_right = 0,len(nums)-1
while p_left <= p_right:
mid = (p_right - p_left)//2 + p_left
if nums[mid] == target:
return mid
if nums[0] <= nums[mid]:
if nums[0]<= target < nums[mid]:
p_right = mid - 1
else:
p_left = mid + 1
else:
if nums[-1] >= target > nums[mid]:
p_left = mid + 1
else:
p_right = mid - 1
return -1
