Python 所有可能的 combinations/permutation X 项目和长度 X+1

Question

我一直在到处搜索，但找不到适合我的问题的东西。假设我有三个数字：['1','2','3'].

我想要，无论是否使用 itertool，所有可能的 combinations/permutations 长度为 4，我只想要包含这 3 个数字的组合（我不想要“1111”或“1221”等） .

想要的结果应该是这样的:
1 2 3 1
1 1 2 3
2 2 3 1

Answer 1

from itertools import combinations_with_replacement as irep
res = [' '.join(x) for x in irep('123',4) if {'1','2','3'}.issubset(x)]

# output
# ['1123', '1223', '1233']

或

from itertools import product
res= [' '.join(x) for x in product('123',repeat=4) if {'1','2','3'}.issubset(x)]
# output
# ['1123', '1132', '1213', '1223', '1231', '1232', '1233',
# '1312', '1321', '1322', '1323', '1332', '2113', '2123', 
# '2131', '2132', '2133', '2213', '2231', '2311', '2312', 
# '2313', '2321', '2331', '3112', '3121', '3122', '3123', 
# '3132', '3211', '3212', '3213', '3221', '3231', '3312', '3321']

Answer 2

import itertools

elements = ['1', '2', '3']
permutations = [''.join(combination) for combination in 
                itertools.product(elements, repeat = 4) if 
                all(elem in combination for elem in elements)]

这会产生您要找的东西吗？

代码产生以下输出：

['1123', '1132', '1213', '1223', '1231', '1232', '1233', '1312', '1321', '1322', '1323', '1332', '2113', '2123', '2131', '2132', '2133', '2213', '2231', '2311', '2312', '2313', '2321', '2331', '3112', '3121', '3122', '3123', '3132', '3211', '3212', '3213', '3221', '3231', '3312', '3321']

Python 所有可能的 combinations/permutation X 项目和长度 X+1

Python all possible combinations/permutation of X items and of length X+1

combinations

permutation

itertools

python-3.x