【牛客剑指offer刷题】：Python：27.字符串的排列

字符串的排列

时间限制：1秒 空间限制：32768K 热度指数：357471
本题知识点： 字符串
算法知识视频讲解

题目描述

输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba。

方法1.使用itertools

>>> from itertools import permutations
>>> permutations(['a', 'b', 'c'])
<itertools.permutations object at 0x7ff7b1411890>
>>> for item in permutations(['a', 'b', 'c']):
...     print item
...
('a', 'b', 'c')
('a', 'c', 'b')
('b', 'a', 'c')
('b', 'c', 'a')
('c', 'a', 'b')
('c', 'b', 'a')

>>> for i in itertools.permutations('123', 2):
...     print i
...
('1', '2')
('1', '3')
('2', '1')
('2', '3')
('3', '1')
('3', '2')
>>> itertools.permutations('123', 2)
<itertools.permutations object at 0x7f5addcca8f0>

代码

# -*- coding:utf-8 -*-
import itertools
class Solution:
    def Permutation(self, ss):
        # write code here
        if not ss:
            return []
        return sorted(list(set(map(''.join, itertools.permutations(ss)))))

方法2.dfs+切片

解析见：https://blog.csdn.net/fuxuemingzhu/article/details/79513101

# -*- coding:utf-8 -*-
class Solution:
    def Permutation(self, ss):
        if not ss:
            return []
        res = []
        self.helper(ss, res, '')
        return sorted(list(set(res)))

    def helper(self, ss, res, path):
        if not ss:
            res.append(path)
        else:
            for i in range(len(ss)):
                self.helper(ss[:i] + ss[i+1:], res, path + ss[i])

方法3.使用DFS+切片+map

解析：https://blog.csdn.net/u010005281/article/details/79920046

def Permutation(self, ss):
    list = []
    if len(ss) <= 1:
        return ss
    for i in range(len(ss)):
        for j in map(lambda x: ss[i]+x, self.Permutation(ss[:i]+ss[i+1:])):
            if j not in list:
                list.append(j)
    return list

---

update：2019年10月6日

方法三另一种写法：

# -*- coding:utf-8 -*-
class Solution:
    def Permutation(self, ss):
        # write code here
        if len(ss) == 1:
            return [ss]
        if ss == "":
            return []
        ans = []
        for i in range(len(ss)):
            temp = self.Permutation(ss[:i]+ss[i+1:])
            for j in temp:
                j = ss[i] + j
                if j not in ans: # 防止出现["aa","aa"]
                    ans.append(j)
        return ans