class Solution {
private:
vector<vector<int> >res;
vector<int>path;
void DFS(int start, int k, int pos, int n, int sum)
{
if(k == pos) //有三个了
{
if(sum == n)
{
res.push_back(path);
}
return ;
}
for(int i = start; i < 9; i++)
{
path.push_back(i+1);
DFS(i+1, k, pos+1, n, sum + i + 1);
path.pop_back();
}
}
public:
vector<vector<int>> combinationSum3(int k, int n) {
DFS(0, k, 0, n, 0);
return res;
}
};
216. 组合总和 III
最新推荐文章于 2020-12-16 15:18:02 发布