寻找列表中最接近指定数字的值
排好序的,使用二分法快速查找
import random
from bisect import bisect_left
def takeClosest(myList, myNumber):
if (myNumber >= myList[-1]):
return myList[-1]
elif myNumber <= myList[0]:
return myList[0]
pos = bisect_left(myList, myNumber) # 找到 mylist 里面第一个不比 mynumber 小(即 >= )的数的索引下标
# 返回的插入点 pos 可以将数组myList分成两部分。左侧是 all(val < x for val in myList[lo:i]) ,右侧是 all(val >= x for val in myList[i:hi])
before = myList[pos - 1]
after = myList[pos]
if after - myNumber < myNumber - before:
return after
else:
return before
array = list(range(10000000))
value = random.randint(1, 10000000)
takeClosest(array, value)
未排好序
import numpy as np
array = np.random.random(10000000)
def find_nearest(array, value):
array = np.asarray(array)
idx = (np.abs(array - value)).argmin()
return array[idx]
利用numpy
特性完爆其他所有的方法