搜索旋转排序数组
搜索旋转排序数组 II
题解
- 搜索旋转排序数组
思路
代码
class Solution:
def search(self, nums: List[int], target: int) -> int:
if not nums: return -1
l, r = 0, len(nums)-1
while l <= r:
mid = (l + r) // 2
if nums[mid] == target: return mid
if nums[l] <= nums[mid]:
if nums[l] <= target < nums[mid]: r = mid - 1
else: l = mid + 1
else:
if nums[mid] < target <= nums[r]: l = mid + 1
else: r = mid - 1
return -1
class Solution:
def search(self, nums: List[int], target: int) -> bool:
if not nums: return False
l, r = 0, len(nums) - 1
while l <= r:
mid = (l + r) // 2
if nums[mid] == target: return True
if nums[l] < nums[mid]:
if nums[l] <= target < nums[mid]: r = mid - 1
else: l = mid + 1
elif nums[l] == nums[mid]: l += 1
else:
if nums[mid] < target <= nums[r]: l = mid + 1
else: r = mid - 1
return False