我试图在长度为2的列表中找到元组中项目的所有排列.元组彼此之间的顺序并不重要.
perm = [(3, 6), (6, 8), (4, 1), (7, 4), (5, 3),
(1, 9), (2, 5), (4, 8), (5, 1), (3, 7),
(6, 9), (10, 2), (7, 10), (8, 2), (9, 10)]
上述列表的一种排列的一个示例如下:
perm = [(6, 3), (6, 8), (4, 1), (7, 4), (5, 3),
(1, 9), (2, 5), (4, 8), (5, 1), (3, 7),
(6, 9), (10, 2), (7, 10), (8, 2), (9, 10)]
另一个排列的例子是:
perm = [(6, 3), (8, 6), (1, 4), (4, 7), (3, 5),
(9, 1), (5, 2), (8, 4), (1, 5), (7, 3),
(9, 6), (2, 10), (10, 7), (2, 8), (10, 9)]
最后,排列列表的长度应该是32768,因 for each 元组要么交换,要么不交换,并且2^15=32768.我不关心元组彼此之间的顺序,只关心元组中项的排列.
我try 过使用迭代工具置换、组合和乘积,但是我没有得到想要的结果.