1.216. 组合总和 III - 力扣(LeetCode)
这道题注意回溯的步骤:递归出口,单次操作,恢复现场
class Solution {
public:
vector<vector<int>>ret;
vector<int>path;
void set(int k,int n ,int sum ,int start)
{
if(path.size()==k)
{
if(sum==n)
{
ret.push_back(path);
}
return;
}
for(int i=start;i<=9;i++)
{
sum+=i;
path.push_back(i);
set(k,n,sum,i+1);
sum-=i;
path.pop_back();
}
}
vector<vector<int>> combinationSum3(int k, int n) {
set(k,n,0,1);
return ret;
}
};