144. Leetcode 90. 子集 II (回溯算法-子集问题)

class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
        res = []
        used = [0] * len(nums)
        def dfs(nums, start_index, path, used):
            res.append(path[:])
            for i in range(start_index, len(nums)):
                if nums[i] == nums[i-1] and i > 0 and not used[i-1]:
                    continue
                path.append(nums[i])
                used[i] = 1
                dfs(nums, i + 1, path, used)
                used[i] = 0
                path.pop()

        dfs(sorted(nums), 0, [], used)

        return res