#二分法查找
def binarySearch(ls, target):
left = 0
right = len(ls)-1
while left <= right:
mid = (left+right) // 2
if target > ls[mid]:
left = mid+1
elif target < ls[mid]:
right = mid-1
else:
return mid
return None