【发布时间】:2020-11-24 13:26:03
【问题描述】:
我想实现这个输出
[(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))
但无法获得所需的结果,请提供任何帮助
【问题讨论】:
标签: python combinations permutation itertools