二分查找前提:有序数组,无重复元素(若重复返回不唯一)
class Solution:def search(self, nums: List[int], target: int) -> int:left = 0right = len(nums)-1while left<=right:mid = (left+right)//2 #//代表地板除(floor),只取小数点前的部分if nums[mid] < target:left = mid + 1elif nums[mid] > target:right = mid - 1else:return midreturn -1
如果觉得《[刷题]leetcode\704_二分查找》对你有帮助,请点赞、收藏,并留下你的观点哦!