Python general method implements the full array of arrays

This example describes the general method of implementing the full array of Python arrays. Share to everyone for your reference. The specific analysis is as follows:

Full permutation explanation: any m (m≤n) elements from n different elements, arranged in a certain order, are called an arrangement of extracting m elements from n different elements. All permutations are called when m=n.

def Perm (L):  if (len (l) <=1):    return [l]  r=[] for  i in range (Len (l)):    s=l[:i]+l[i+1:]    p= Perm (s) for    X in P:      r.append (l[i:i+1]+x)  return R

Call Method:

If __name__== ' __main__ ': "" "   default param is List (1,2,3,4,5)" ""  l=[];   if (Len (SYS.ARGV) <=1): "" "     input=['%d '% (i) for I in Xrange (1,6)]" ""    L=list ((1,2,3,4,5))  else:# Input param looks like "2,3,4,5,6" and no legal checks here.    Input=str (sys.argv[1])    l=input.split (",") for     I in Xrange (Len (L)):       l[i] = Int (l[i])   print perm (l )

Hopefully this article will help you with Python programming.

