Python搜索旋转排序数组算法题-LeetCode(力扣)源代码
class Solution:
def search(self, nums: List[int], target: int) -> int:
left, right = 0, len(nums) - 1
while left <= right:
mid = (left + right) // 2
if nums[mid] == target:
return mid
elif nums[mid] >= nums[left]:
if nums[left] <= target < nums>
right = mid - 1
else:
left = mid + 1
else:
if nums[mid] < target>
left = mid + 1
else:
right = mid - 1
return -1
文件大小：3.08KB
评论区