def bSearch(arr,x):
left,right=0,len(arr)-1
while left<=right:
middle=(left+right)//2
if arr[middle]==x:
return middle
elif x<arr[middle]:
right=middle-1
else:
left=middle+1
return left
二分搜索
最新推荐文章于 2023-01-07 20:29:55 发布