lis python_多个lis的python组合

有没有什么pythonic方法可以在多个列表之间生成组合？(类似于笛卡尔积，但更复杂)

示例：a = [1, 2, 3]

b = [4, 5, 6]

c = [7, 8, 9]

# ...

# there are more than 3 lists

预期产量：

^{pr2}$

更新：

谢谢你的快速回复~！！在

为了澄清这个问题：

结果是表a、b、c的笛卡尔积的不重复组合

可以用另一种难看的方法来完成：

1)生成笛卡尔积的整个列表from itertools import product, combinations, chain

t = list(product(a, b, c))

2)使用组合生成所有可能的结果p = list(combinations(t, 3))

3)过滤重复条件cnt = len(list(chain(a, b, c)))

f = [x for x in p if len(set(chain(*x))) == cnt]

更新2:

丑陋方法生成的预期结果：((1, 4, 7), (2, 5, 8), (3, 6, 9))

((1, 4, 7), (2, 5, 9), (3, 6, 8))

((1, 4, 7), (2, 6, 8), (3, 5, 9))

((1, 4, 7), (2, 6, 9), (3, 5, 8))

((1, 4, 8), (2, 5, 7), (3, 6, 9))

((1, 4, 8), (2, 5, 9), (3, 6, 7))

((1, 4, 8), (2, 6, 7), (3, 5, 9))

((1, 4, 8), (2, 6, 9), (3, 5, 7))

((1, 4, 9), (2, 5, 7), (3, 6, 8))

((1, 4, 9), (2, 5, 8), (3, 6, 7))

((1, 4, 9), (2, 6, 7), (3, 5, 8))

((1, 4, 9), (2, 6, 8), (3, 5, 7))

((1, 5, 7), (2, 4, 8), (3, 6, 9))

((1, 5, 7), (2, 4, 9), (3, 6, 8))

((1, 5, 7), (2, 6, 8), (3, 4, 9))

((1, 5, 7), (2, 6, 9), (3, 4, 8))

((1, 5, 8), (2, 4, 7), (3, 6, 9))

((1, 5, 8), (2, 4, 9), (3, 6, 7))

((1, 5, 8), (2, 6, 7), (3, 4, 9))

((1, 5, 8), (2, 6, 9), (3, 4, 7))

((1, 5, 9), (2, 4, 7), (3, 6, 8))

((1, 5, 9), (2, 4, 8), (3, 6, 7))

((1, 5, 9), (2, 6, 7), (3, 4, 8))

((1, 5, 9), (2, 6, 8), (3, 4, 7))

((1, 6, 7), (2, 4, 8), (3, 5, 9))

((1, 6, 7), (2, 4, 9), (3, 5, 8))

((1, 6, 7), (2, 5, 8), (3, 4, 9))

((1, 6, 7), (2, 5, 9), (3, 4, 8))

((1, 6, 8), (2, 4, 7), (3, 5, 9))

((1, 6, 8), (2, 4, 9), (3, 5, 7))

((1, 6, 8), (2, 5, 7), (3, 4, 9))

((1, 6, 8), (2, 5, 9), (3, 4, 7))

((1, 6, 9), (2, 4, 7), (3, 5, 8))

((1, 6, 9), (2, 4, 8), (3, 5, 7))

((1, 6, 9), (2, 5, 7), (3, 4, 8))

((1, 6, 9), (2, 5, 8), (3, 4, 7))