题解 | #字符串的排列#
字符串的排列
https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7
# # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param str string字符串 # @return string字符串一维数组 # class Solution: def Permutation(self , str: str) -> List[str]: # write code here sset = [] rst = [] if len(str) <= 1: return [str] for i in range(len(str)): s = str[i] if s in sset: continue sset.append(s) if i == len(str)-1: p = self.Permutation(str[:i]) else: p = self.Permutation(str[:i]+str[i+1:]) # print(p) for j in range(len(p)): p[j] = s + p[j] rst += p return rst
方法:递归。
需要去除重复的排列。