题目描述
输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba。
思路及Python实现
思路一:递归写法
递归写法一
class Solution:
def Permutation(self, ss):
# write code here
list = []
if len(ss) <= 1:
return ss
left = ss[0]
right = self.Permutation(ss[1:])
for word in right:
for i in range(len(word) + 1):
if word[:i] + left + word[i:] not in list: # 去重
list.append(word[:i] + left + word[i:])
list.sort() # 按字典序输出
return list
思路二:字典序算法
class Solution:
def Permutation(self, ss):
res = []
if ss == "":
return res
if len(ss) == 1:
return [ss]
strlist = []
for i in range(len(ss)):
strlist.append(ss[i])
strlist.sort()
res.append("".join(strlist))
size = len(strlist)
while True:
p = size - 1
while p >= 1 and strlist[p - 1] >= strlist[p]:
p -= 1
if p == 0:
break
q = p
p -= 1
while q < size and strlist[q] > strlist[p]:
q += 1
q -= 1
self.swap(strlist, p, q)
self.reverse(strlist, p + 1, size - 1)
res.append("".join(strlist))
return res
def swap(self, strlist, p, q):
strlist[p], strlist[q] = strlist[q], strlist[p]
def reverse(self, array, i, j): # 元素反转函数
if array is None or i < 0 or j < 0 or i >= j or len(array) < j + 1:
return
while i < j:
self.swap(array, i, j)
i += 1
j -= 1