Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
Ensure that numbers within the set are sorted in ascending order.
Example 1:
Input: k = 3, n = 7
Output:
[[1,2,4]]
Example 2:
Input: k = 3, n = 9
Output:
[[1,2,6], [1,3,5], [2,3,4]]
public class Solution {
public List<List<Integer>> combinationSum3(int k, int n) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if(k<1 || n<1) return res;
helper(res, k, n, 1, 0, new ArrayList<Integer>());
return res;
}
public void helper(List<List<Integer>> res,int k,int n,int cur_k,int cur_sum,List<Integer> item){
if(k==0&&cur_sum==n){
res.add(new ArrayList<Integer>(item));
}else if(cur_sum>n||cur_k<=0) return;
for(int i=cur_k;i<=9;i++){
item.add(i);
helper(res, k-1, n, i+1, cur_sum+i, item);
item.remove(item.size()-1);
}
}
}