本题题目要求如下:
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:
vector<vector<int>> combinationSum3(int k, int n) {
vector<int> tmp;
for (int i = 1; i <= 9; ++i) {
if (n >= i) {
dfs(k-1, n-i, i, tmp);
}
}
return res;
}
private:
vector<vector<int>> res;
void dfs(int k, int n, int val, vector<int> tmp) {
tmp.push_back(val);
if (k == 0) {
if (n == 0) {
res.push_back(tmp);
}
return;
}
for (int i = val + 1; i <= 9; ++i) {
if (n >= i) {
dfs(k-1, n-i, i, tmp);
}
}
tmp.pop_back();
}
};