我刚刚实现了你所要求的
boxSizes, itemSizes = [5, 3, 6], [1, 2, 2, 3, 5]
def recurse(boxes, itemIndex, solution, itemsUsed):
global itemSizes
if itemsUsed == len(itemSizes):
print solution
return
for i in range(len(boxes)):
for j in range(itemIndex, len(itemSizes)):
if boxes[i] - itemSizes[j] >= 0:
boxes[i] -= itemSizes[j]
solution[i].append(itemSizes[j])
recurse(boxes, j + 1, solution, itemsUsed + 1)
solution[i].pop()
boxes[i] += itemSizes[j]
recurse(boxSizes, 0, [[] for i in range(len(boxSizes))], 0)
输出
[[1, 2, 2], [3], [5]]
[[2, 3], [1, 2], [5]]
[[2, 3], [1, 2], [5]]
[[5], [1, 2], [2, 3]]
[[5], [1, 2], [2, 3]]
[[2, 2], [3], [1, 5]]
[[2, 3], [2], [1, 5]]
[[2, 3], [2], [1, 5]]
[[5], [2], [1, 2, 3]]
[[5], [2], [1, 2, 3]]
[[5], [3], [1, 2, 2]]
我们看到一些重复的解决方案,这是因为输入中有两个相同的数字。