47-Permutations-Ii
Sat 17 May 2025
https://leetcode.com/problems/permutations-ii
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def permuteUnique(self, nums: List[int]) -> List[List[int]]:
ans = []
used = [False] * len(nums)
def dfs(path: List[int]) -> None:
if len(path) == len(nums):
ans.append(path.copy())
return
for i, num in enumerate(nums):
if used[i]:
continue
if i > 0 and nums[i] == nums[i - 1] and not used[i - 1]:
continue
used[i] = True
path.append(num)
dfs(path)
path.pop()
used[i] = False
nums.sort()
dfs([])
return ans
new Solution().permuteUnique()
Score: 5
Category: leetcode