Python3 代码:
class Solution:
def search(self, nums: List[int], target: int) -> int:
left=0
right=len(nums)-1
while left <= right: # 必须要小于等于
mid=(left+right)//2 # //表示取整除 - 向下取接近商的整数
if nums[mid] == target:
return mid
elif nums[mid] < target:
left = mid+1
else:
right = mid-1
else:
return -1