Python permutations of two integers of given length

Question

Is there an easy way in Python to calculate all possible permutations of a given length with two integers using one or both integers. For example, if my integers are 1 and 2 and I want to calculate all possible permutations of length 3, I should get (111, 112, 121, 122, 211, 212, 221, 222). I thought that itertools.permutations would work, but apparently if the length is > the number of integers, no items are returned.

Thanks, that is exactly what I needed. I don't know why it did not come up in my search. — henrypj, Jun 20 '17 at 18:24

Brad Solomon · Answer 1 · 2017-06-21T02:37:43.213

1

If what you're looking for is simply:

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

then see Permutation of x length of 2 characters, and this thread is a duplicate.

If, alternatively, what you're looking for is

[11, 12, 21, 22]

then use:

import itertools as it
print([int(str(i) + str(j)) for i, j in it.product(l, repeat=2)])
[11, 12, 21, 22]

edited Jun 21 '17 at 02:37

answered Jun 20 '17 at 18:18

Brad Solomon

38,521
31
149
235

score -1 · Answer 2 · answered Jun 20 '17 at 17:56

import itertools

length = 3
possible_int = [1,2]
all_permutations = []
for i in range(length+1):
    first = [possible_int[0]]*i
    second = [possible_int[1]]*(length-i)
    permutations = [list(x) for x in itertools.permutations(first+second)]
    for element in permutations:
        if element not in all_permutations:
            all_permutations.append(element)

print(all_permutations)

Python permutations of two integers of given length

2 Answers2