将列表中的None替换为从邻居传播的值

def propagate_neighbors(lst, max_iter=100):
    propagate_nodes = [i for i, val in enumerate(lst) if val is None]
    iter_count = 0

    while propagate_nodes and iter_count < max_iter:
        new_propagate_nodes = []
        for node in propagate_nodes:
            neighbors = [lst[i] for i in get_neighbors(node)]  # 获取邻居节点的值
            if all(neighbors):  # 如果邻居节点的值不全为None
                lst[node] = sum(neighbors) / len(neighbors)  # 计算邻居节点值的平均值
            else:
                new_propagate_nodes.append(node)  # 邻居节点的值全为None，保持当前节点的值不变
        propagate_nodes = new_propagate_nodes
        iter_count += 1

    return lst

def get_neighbors(node):
    # 根据具体的图结构，获取节点的邻居节点
    # 这里假设图是一个列表，每个节点的邻居节点为其前后相邻的节点
    return [node-1, node+1]

# 示例用法
lst = [1, None, 3, None, 5]
result = propagate_neighbors(lst)
print(result)