python - 使用迭代器从 [1, 2, 3] 中获取特定的列表序列

Question

这个问题已经有答案了:

How can I get "permutations with repetitions/replacement" from a list (Cartesian product of a list with itself)? (6 个回答)

已关闭 3 年前。

我想实现这个输出

[(1, 1, 1), (1, 1, 2), (1, 1, 3), (1, 2, 1), (1, 2, 2), (1, 2, 3), (1, 3, 1), (1, 3, 2), (1, 3, 3), (2, 1, 1), (2, 1, 2), (2, 1, 3), (2, 2, 1), (2, 2, 2), (2, 2, 3), (2, 3, 1), (2, 3, 2), (2, 3, 3), (3, 1, 1), (3, 1, 2), (3, 1, 3), (3, 2, 1), (3, 2, 2), (3, 2, 3), (3, 3, 1), (3, 3, 2), (3, 3, 3)]

从此给定列表:[1,2,3] .

我尝试过使用

foo = [1, 2, 2]
print(list(permutations(foo, 3)))

还有这个

l

ist(it.combinations_with_replacement([1,2,3], 3))

from itertools import combinations 
  
def rSubset(arr, r): 
   
    return list(combinations(arr, r)) 
  
 
if __name__ == "__main__": 
    arr = [1, 2, 3] 
    r = 3
    print (rSubset(arr, r))

但我无法获得所需的结果，请提供帮助

Answer 1

您想要一个产品，而不是排列或组合。

from itertools import product

print(list(product([1,2,3], repeat=3)))