algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 13:00:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0047.全排列II.md

Browse Source
This commit is contained in:
jianghongcheng
2023-05-27 21:20:59 -05:00
committed by GitHub
parent b033a08c13
commit fd2608a38c
1 changed files with 19 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
problems/0047.全排列II.md
View File

@ -208,28 +208,25 @@ class Solution {
```python ```python
class Solution: class Solution:
def permuteUnique(self, nums: List[int]) -> List[List[int]]: def permuteUnique(self, nums):
# res用来存放结果 nums.sort() # 排序
if not nums: return [] result = []
res = [] self.backtracking(nums, [], [False] * len(nums), result)
used = [0] * len(nums) return result
def backtracking(nums, used, path):
# 终止条件 def backtracking(self, nums, path, used, result):
if len(path) == len(nums): if len(path) == len(nums):
res.append(path.copy()) result.append(path[:])
return return
for i in range(len(nums)): for i in range(len(nums)):
if not used[i]: if (i > 0 and nums[i] == nums[i - 1] and not used[i - 1]) or used[i]:
if i>0 and nums[i] == nums[i-1] and not used[i-1]:
continue continue
used[i] = 1 used[i] = True
path.append(nums[i]) path.append(nums[i])
backtracking(nums, used, path) self.backtracking(nums, path, used, result)
path.pop() path.pop()
used[i] = 0 used[i] = False
# 记得给nums排序
backtracking(sorted(nums),used,[])
return res
``` ```
### Go ### Go