class Solution:
def permuteUnique(self, nums: List[int]) -> List[List[int]]:
nums.sort()
self.used=[False]*len(nums)
l=[]
def back(tmp):
if len(tmp)==len(nums):
l.append(tmp[:])
else:
for i in range(len(nums)):
if not self.used[i]:
if i>0 and not self.used[i-1] and nums[i]==nums[i-1]:
continue
self.used[i]=True
tmp.append(nums[i])
back(tmp)
self.used[i]=False
tmp.pop()
back([])
return l
在leetcode中,'='写成了“==”,好多次找不到bug在哪里,会死的很惨
最新推荐文章于 2022-10-13 23:41:22 发布