题解 | #字符串的排列#

# -*- coding:utf-8 -*-
class Solution:
    def Permutation(self, ss):
        # write code here
        ans=[]
        def dfs(index,s,strs):
            if index==len(ss):
                ans.append(strs)
                return
            for i in range(len(s)):
                dfs(index+1,s[:i]+s[i+1:],strs+s[i])
        dfs(0,ss,"")
        ans=list(set(ans))
        return ans