摘要： 二分查找算法（简单版，修改）： l = [2,3,5,10,15,16,18,22,26,30,32,35,41,42,43,55,56,66,67,69,72,76,82,83,88] def func(l,aim,s=0,end=len(l)-1): mid = (len(l)-1)//2 nextIndex = s + mid+1 # lastM = mid ... 阅读全文