python递归排序_Python中字符串的所有排列（递归）

I need a kick in the head on this one. I have the following recursive function defined:

def perms(s):

if(len(s)==1):

return s

res = ''

for x in xrange(len(s)):

res += s[x] + perms(s[0:x] + s[x+1:len(s)])

return res + '\n'

perms("abc") currently returns:

abccb

bacca

cabba

The desired result is

abc

acd

bac

bca

cab

cba

Where am I going wrong here? How can I think about this differently to come up with the solution?

Note: I am aware of the itertools function. I am trying to understand how to implement permutations recursively for my own learning. That is why I would prefer someone to point out what is wrong with my code, and how to think differently to solve it. Thanks!

解决方案

There you go (recursive permutation):

def Permute(string):

if len(string) == 0:

return ['']

prevList = Permute(string[1:len(string)])

nextList = []

for i in range(0,len(prevList)):

for j in range(0,len(string)):

newString = prevList[i][0:j]+string[0]+prevList[i][j:len(string)-1]

if newString not in nextList:

nextList.append(newString)

return nextList

In order to get a list of all permutation strings, simply call the function above with your input string. For example,

stringList = Permute('abc')

In order to get a single string of all permutation strings separated by new-line characters, simply call '\n'.join with the output of that function. For example,

string = '\n'.join(Permute('abc'))

By the way, the print results for the two options above are identical.