classSolution:defpermuteUnique(self, nums: List[int])-> List[List[int]]:iflen(nums)==1:return[nums]
a =[]
k =[]for i inrange(len(nums)):
b = nums[:i]+ nums[i+1:]
s = nums[i]if s in k:continueelse:
k.append(s)
c = self.permuteUnique(b)
a = a+[[s]+ j for j in c]return a
# 执行用时 :88 ms, 在所有 Python3 提交中击败了77.36%的用户# 内存消耗 :14.1 MB, 在所有 Python3 提交中击败了9.35%的用户