摘要： def binary_search(nums,key): if len(nums)<1: return -1 high=len(nums)-1 low=0 while low<=high: mid=(low+high)//2 if low<=high and nums[mid]>key: high= 阅读全文