用bisect实现哈希环查找

def solve(nodes, key):
    import bisect
    import hashlib
    nodes = nodes.split(',') if isinstance(nodes, str) else nodes
    node_hashes = sorted([(hashlib.sha256(n.encode()).hexdigest(), n) for n in nodes])
    key_hash = hashlib.sha256(key.encode()).hexdigest()
    hashes = [h for h, n in node_hashes]
    idx = bisect.bisect_left(hashes, key_hash)
    if idx >= len(hashes):
        idx = 0
    print(node_hashes[idx][1])