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]]
class Solution {
public:
#define maxval (9)
void helper(int k,int n,int curval,vector<int>&tmp,vector<vector<int>>& res){
if(k<0) return;
if(k==0&&n==0){
res.push_back(tmp);
return;
}
for(int val=curval;val<=maxval;val++){
tmp.push_back(val);
helper(k-1,n-val,val+1,tmp,res);
tmp.pop_back();
}
}
vector<vector<int>> combinationSum3(int k, int n) {
vector<int>tmp;
vector<vector<int>> res;
helper(k,n,1,tmp,res);
return res;
}
};