给定一个三元组列表,例如:[(1,2,3), (4,5,6), (7,8,9)]如何计算所有可能的组合和子集组合?
在这种情况下,结果应如下所示:
[
(1), (1,4), (1,5), (1,6), (1,7), (1,8), (1,9), (1,4,7), (1,4,8), (1,4,9), (1,5,7), (1,5,8), (1,5,9), (1,6,7), (1,6,8), (1,6,9),
(2), ...,
(3), ...,
(4), (4,7), (4,8), (4,9),
(5), (5,7), (5,8), (5,9),
(6), (6,7), (6,8), (6,9),
(7), (8), (9)
]
Run Code Online (Sandbox Code Playgroud)
(1,2),(4,6)或(7,8,9))