class Solution {
public:
vector<vector<int>> combinationSum3(int k, int n) {
vector<vector<int> > res;
vector<int> set;
helper(k,n,1,set,res);
return res;
}
void helper(int k,int n,int start,vector<int>& set,vector<vector<int> >& res)
{
if(k==0)
{
if(n==0)
res.push_back(set);
return;
}
if(n<=0)
return;
for(int i=start;i<10;i++)
{
set.push_back(i);
helper(k-1,n-i,i+1,set,res);
set.pop_back();
}
}
};
leetcode 216: Combination Sum III
最新推荐文章于 2023-05-22 12:05:46 发布