How to calculate a Cartesian product of a list with itself [duplicate]

狂风中的少年 提交于 2020-07-03 05:42:18

问题


For example,

list = [0, 1, 2]

I want a list of all possible 2-combinations:

combinations = [(0,0), (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), (2,1), (2,2)]

It seems to me that all the tools in itertools in Python only make one of (1,0) and (0,1), not both, I need both. Any suggestions, other than entering them by hand?


回答1:


You are looking for a Cartesian product of that list with itself, not a permutation nor a combination. Therefore you should use itertools.product with repeat=2:

from itertools import product

li = [0, 1, 2]
print(list(product(li, repeat=2)))
>> [(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)]



回答2:


Can be done by importing itertools:

import itertools

list1 = [0, 1, 2]
print(list(itertools.product(list1,repeat=2)))

Output:

[(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)]

Resource: You can learn more about it - here



来源:https://stackoverflow.com/questions/41088160/how-to-calculate-a-cartesian-product-of-a-list-with-itself

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!