摘要： def bin(alist,target): i,j=0,len(alist)-1 while i<=j: m = (i+j)//2 if target == alist[m]: return m if target > alist[m]: i = m+1 else: j = m-1 return 阅读全文