Combination Sum II LeetCode solution in Python

1
# Runtime: 204 ms (Top 15.17%) | Memory: 14.1 MB (Top 23.77%)
2
class Solution(object):
3
    def combinationSum2(self, candidates, target):
4
        res = []
5

6
        def dfs(nums, summ, curr):
7
            if summ >= target:
8
                if summ == target:
9
                    res.append(curr)
10
                return
11
            for i in range(len(nums)):
12
                if i != 0 and nums[i] == nums[i - 1]:
13
                    continue
14
                dfs(nums[i + 1 :], summ + nums[i], curr + [nums[i]])
15

16
        dfs(sorted(candidates), 0, [])
17
        return res