1、题目描述:
2、题解:
二分查找:
与nums[right]作比较
class Solution:
def search(self, nums: List[int], target: int) -> bool:
#二分查找
if not nums:return False
left,right =0,len(nums) - 1
while left <= right:
mid = left + (right - left) // 2
if nums[mid] == target:
return True
if nums[mid] > nums[right]:
if nums[left] <= target < nums[mid]:
right = mid - 1
else:
left = mid + 1
elif nums[mid] < nums[right]:
if nums[mid] < target <= nums[right]:
left = mid +1
else:
right = mid - 1
elif nums[mid] == nums[right]:
right -= 1
return False
3、复杂度分析:
时间复杂度:O(logN)
空间复杂度:O(1)