题目:
输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba(输入一个字符串,长度不超过9(可能有字符重复,字符只包括大小写字母。)
思路:
此类问题属于全排列问题,以str = “1234” 举例 看如何解决此类问题
# -*- coding:utf-8 -*-
class Solution:
def Permutation(self, ss):
# write code here
out = []
if len(ss) == 0:
return out
charlist = list(ss)
self.permutation(charlist, 0, out)
out = [''.join(out[i]) for i in range(len(out))]
out.sort()
return out
def permutation(self, ss, begin, out):
if begin == len(ss)-1:
out.append(ss[:])
else:
for i in range(begin, len(ss)):
# 如果是重复字符,跳过
if ss[begin] == ss[i] and begin != i: ##这里重复判断会有漏洞 但由于python中set的存在可以去掉重复的,所以大家不用担心
continue
else:
# 依次与后面每个字符交换
ss[begin], ss[i] = ss[i], ss[begin]
self.permutation(ss, begin + 1, out)
# 回到上一个状态
ss[begin], ss[i] = ss[i], ss[begin]