leetcode刷题python之全排列2

回溯算法

class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        nums.sort()
        result = []
        def backtrack(nums , tmp):
            if not nums :
                result.append(tmp)
            else:
                for i in range(len(nums)):
                    if i > 0 and nums[i] == nums[i-1]:
                        continue
                    backtrack(nums[:i] + nums[i+1:] , tmp + [nums[i]])
        backtrack(nums , [])
        return result