33 搜索旋转排序数组
class Solution:
def search(self, nums: List[int], target: int) -> int:
i,j=0,len(nums)-1
while i<=j:
m=(i+j)//2
if target==nums[j]:return j
if nums[m]>nums[j]:
if target>nums[j]:j-=1
else:i=m+1
else:
if target>nums[j]:j=m-1
else:j-=1
return -1
81 搜索旋转排序数组 II
class Solution:
def search(self, nums: List[int], target: int) -> bool:
i,j=0,len(nums)-1
while i<=j:
m=(i+j)//2
if target==nums[j]:return True
while i<j and nums[i]==nums[j]:
i+=1
j-=1
m=(i+j)//2
if target==nums[j]:return True
if nums[m]>nums[j]:
if target>nums[j]:j-=1
else:i=m+1
else:
if target>nums[j]:j=m-1
else:j-=1
return False