Combination Sum III LeetCode solution in Python

1
class Solution:
2

3
    def solve(self, k, target, ans, temp, idx, nums):
4

5
        if idx == len(nums):
6
            if target == 0 and k == 0:
7
                ans.append(list(temp))
8
            return
9

10
        if nums[idx] <= target:
11

12
            temp.append(nums[idx])
13
            self.solve(k - 1, target - nums[idx], ans, temp, idx + 1, nums)
14
            temp.pop()
15

16
        self.solve(k, target, ans, temp, idx + 1, nums)
17

18
    def combinationSum3(self, k: int, n: int) -> List[List[int]]:
19

20
        ans = []
21
        temp = []
22
        idx = 0
23
        nums = list(range(1, 10))
24

25
        self.solve(k, n, ans, temp, idx, nums)
26
        return ans