[LeetCode] 216. Combination Sum III

public class Solution {
    public List<List<Integer>> combinationSum3(int k, int n) {
        List<List<Integer>> list = new ArrayList<>();
        if(k > n){
            return list;
        }
        helper(list, new ArrayList<>(), k, 1, n);
        return list;
    }
    
    private void helper(List<List<Integer>> list, List<Integer> temp, int k, int start, int remain){
        if(remain == 0 && k == 0){
            list.add(new ArrayList<>(temp));
            return;
        }
        if(remain < 0){
            return;
        }
        for(int i = start; i <= 9; i++){
            temp.add(i);
            helper(list, temp, k - 1, i + 1, remain - i);
            temp.remove(temp.size() - 1);
        }
    }
}