给定一个可包含重复数字的序列,返回所有不重复的全排列。
示例:
输入: [1,1,2]
输出:
[
[1,1,2],
[1,2,1],
[2,1,1]
]
思路:
跟LeetCode-Python-46. 全排列基本相同,只加了一个去重的步骤。
class Solution(object):
def permuteUnique(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res, l = list(), len(nums)
def dfs(n, tmp):
if len(tmp) == l:
if tmp not in res:
res.append(tmp[:])
return
for i, x in enumerate(n):
tmp.append(x)
dfs(n[:i] + n[i + 1:], tmp)
tmp.pop()
for i, x in enumerate(nums):
dfs(nums[:i] + nums[i + 1:], [x])
return res
updated:
用hashmap代替list判断重复。
class Solution(object):
def permuteUnique(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res = []
record = dict()
def dfs(tmp, nums):
if not nums:
if record.get(tuple(tmp), 0) == 0:
res.append(tmp)
record[tuple(tmp)] = 1
for i, x in enumerate(nums):
dfs(tmp + [x], nums[:i] + nums[i + 1:])
dfs([], nums)
return res
updated again:
在循环里去重。
class Solution(object):
def permuteUnique(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
res = []
record = dict()
def dfs(tmp, nums):
if not nums:
res.append(tmp)
for i, x in enumerate(nums):
if i == 0 or nums[i] != nums[i - 1]:
dfs(tmp + [x], nums[:i] + nums[i + 1:])
dfs([], nums)
return res