如何使用python在列表中的中心索引位置均匀分布唯一项？

def evenly_distribute_unique_items(lst, unique_item):
    total_length = len(lst)
    left_index = 0
    right_index = total_length - 1

    while left_index < right_index:
        left_sum = sum(lst[:left_index+1])
        right_sum = sum(lst[right_index:])

        if left_sum == right_sum:
            lst.insert(left_index+1, unique_item)
            right_index += 1
        elif left_sum < right_sum:
            left_index += 1
        else:
            right_index -= 1

    return lst

# 示例用法
my_list = [1, 2, 3, 4, 5, 6]
unique_item = 7

result = evenly_distribute_unique_items(my_list, unique_item)
print(result)