在python上重复的所有可能的组合和排列

Question

Essentially, I want to do

def get_all_possible(N)
    for i0 in range(N) :
        for i1 in range(N) :
            for i2 in range(N) :
             ... for iNm1 in range(N) : #Nm1 is N minus 1
                     yield [i0,i1,i2,i3,...,iNm1]

and make a list of all the possible combination of number 0-N at each index and their permutations. So when N=4 then there should be 4^4 possible combinations to be output. This nested for loop is not efficient, and the code is not easily expandable to general N case.

Answer 1

A solution that helps readability is itertools.product

import itertools
all_combs = list(itertools.product(range(4), repeat=4))

Answer 2

尝试itertools.permutations或itertools.combinations