python：有序的列表中模糊匹配给定的数值

给定一个值，在列表中查找近似的对应的值

列表需要有序，正序逆序均可

from bisect import bisect_left
def takeClosest(myList, myNumber):
    if myNumber >= max(myList):
        return max(myList)
    elif myNumber <= min(myList):
        return min(myList)
    if myList[0] < myList[1]:
        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
    else:
        myList = myList[::-1]
        pos = takeClosest(myList, myNumber)
        return pos

测试一下

list=[35.11225,35.2365556,35.3656545,35.4556685]
answer = takeClosest(cityarea_list, 35.40)
print(answer)
输出：35.3656545

参考中南自动化学院“智能控制与优化决策“至渝但是这个列表必须正序