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.
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:
vector<vector<int>> combinationSum3(int k, int n) {
vector<int> numb = {1,2,3,4,5,6,7,8,9};
vector<vector<int>> res;
vector<int> solve;
combinationsum(res, numb, solve, k, n);
return res;
}
private:
void combinationsum(vector<vector<int>>& res, vector<int> numb, vector<int>& solve, int k, int target){
if(!target)
{
if(solve.size() == k)
{
res.push_back(solve);
return;
}
else
return;
}
for(int i = 0; i<numb.size(); i++)
{
solve.push_back(numb[i]);
vector<int> temp = numb;
temp.erase(temp.begin(), temp.begin()+i+1);
combinationsum(res, temp, solve, k, target-numb[i]);
solve.pop_back();
}
}
};