def max_wall_layers(blocks):total_length = sum(blocks)max_layers = 0# 遍历可能的层数for layers in range(1, len(blocks) + 1):if total_length % layers != 0:continuetarget_length = total_length // layers# 复制积木列表以便操作temp_blocks = blocks.copypossible = Truefor _ in range(layers):found = False# 尝试找到一个积木或两个积木拼接等于目标长度for i in range(len(temp_blocks)):if temp_blocks[i] == target_length:temp_blocks.pop(i)found = Truebreakfor j in range(i + 1, len(temp_blocks)):if temp_blocks[i] + temp_blocks[j] == target_length:temp_blocks.pop(j)temp_blocks.pop(i)found = Truebreakif found:breakif not found:possible = Falsebreakif possible:max_layers = layersreturn max_layers if max_layers > 0 else -1# 自定义输入blocks = list(map(int, input("请输入积木的长度，用空格分隔: ").split))result = max_wall_layers(blocks)print("最大层数为:", result)计算总长度：首先计算所有积木的总长度。因为每层的长度必须相同，所以总长度必须能被层数整除。确定可能的层数：层数的可能取值范围是从1到总长度的一半。我们需要找到一个最大的层数，使得总长度能被层数整除，并且每层的长度可以通过一个或两个积木拼接得到。检查每层的可行性：对于每个可能的层数，检查是否可以将积木分配到每层，使得每层的长度等于总长度除以层数。摘要：def max_wall_layers(blocks):total_length = sum(blocks)max_layers = 0# 遍历可能的层数for layers in range(1, len(blocks) + 1):if total_leng
来源：伟祺教育
