题目描述
积木宽高相等,长度不等,每层只能放一个或拼接多个积木,每层长度相等,求最大层数,最少2层。
输入
给定积木的长度,以空格分隔,例如:3 6 6 3。
输出
如果可以搭建,返回最大层数,如果不可以返回-1。
直接上代码...
from traceback import format_exc
def closure(data: list, k: int):
floor = 0
while data and data[0] == k:
data.pop(0)
floor += 1
for ii in data:
if abs(k - ii) in data:
i_index = data.index(ii)
data.pop(i_index)
ii_index = data.index(abs(k - ii))
data.pop(ii_index)
floor += 1
if len(data) != 0 and sum(data) == k:
floor += 1
elif len(data) != 0:
floor = -1
return floor
if __name__ == '__main__':
while True:
try:
_input = input()
blocks = sorted([int(_) for _ in _input.split()], reverse=True)
max_block = max(blocks)
result = [-1]
# 最大遍历数字,取最大公因数
for i in range(2, int(sum(blocks) / 2) + 1):
# 判断每层长度为i时是否能搭建
if sum(blocks) % i == 0 and i >= max_block:
# 每一层的长度
range_num = closure(data=blocks, k=i)
result.append(range_num)
print(max(result))
break
except Exception as e:
print(e, format_exc())
break