在Python中从多个列表中获取所有组合的最佳方法(保留副本)

from itertools import product

list1 = [1, 2, 3]
list2 = ['a', 'b', 'c']
list3 = ['x', 'y', 'z']

combinations = list(product(list1, list2, list3))
print(combinations)

[(1, 'a', 'x'), (1, 'a', 'y'), (1, 'a', 'z'), (1, 'b', 'x'), (1, 'b', 'y'), (1, 'b', 'z'), (1, 'c', 'x'), (1, 'c', 'y'), (1, 'c', 'z'), (2, 'a', 'x'), (2, 'a', 'y'), (2, 'a', 'z'), (2, 'b', 'x'), (2, 'b', 'y'), (2, 'b', 'z'), (2, 'c', 'x'), (2, 'c', 'y'), (2, 'c', 'z'), (3, 'a', 'x'), (3, 'a', 'y'), (3, 'a', 'z'), (3, 'b', 'x'), (3, 'b', 'y'), (3, 'b', 'z'), (3, 'c', 'x'), (3, 'c', 'y'), (3, 'c', 'z')]