7.6 leetcode

class :	
    def combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        res = []
        candidates.sort()
        self.dfs(candidates, target, 0, [], res)
        return res
        
    def dfs(self, nums, target, index, path, res):
        if target < 0:
            return
        elif target == 0:
            res.append(path)
            return

        for i in range(index, len(nums)):
            self.dfs(nums, target-nums[i], i, path + [nums[i]], res)

sol = Solution()
out = sol.combinationSum([2, 3, 6, 7], 7)
print(out)

class :
    def combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        res = []
        candidates.sort()
        self.dfs(candidates, target, 0, [], res)
        real_out = {}
        for o in res:
            a = tuple(o)
            real_out.setdefault(a)

        rr_out = []
        for r in real_out.keys():
            r = list(r)
            rr_out.append(r)

        return rr_out

    def dfs(self, nums, target, index, path, res):
        if target < 0:
            return
        elif target == 0:
            res.append(path)
            return

        for i in range(index, len(nums)):
            self.dfs(nums, target-nums[i], i+1, path + [nums[i]], res)

sol = Solution()
out = sol.combinationSum([1, 0, -1, 0, -2, 2], 0)
print(out)