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):
left = mid+1
elif(nums[mid]>target):
right = mid-1
else:
return mid
return -1
二分查找法
可以将mid 写成 mid = (right-left)//2+left
记得判断完大于小于后
要将mid的指针加一或减一