leetcode 704
易错点:边界部分
1. while(left<=or<)
2. middle 还是middle-1
左闭右闭 还是左闭右开
左闭右闭
class Solution:
def search(self, nums: List[int], target: int) -> int:
left=0
right=len(nums)-1
while left<=right:
middle=left+(right-left)//2
if nums[middle]>target:
right=middle-1
elif nums[middle]<target:
left=middle+1
else:
return middle
return -1