/*
* @lc app=leetcode id=216 lang=cpp
*
* [216] Combination Sum III
*/
// @lc code=start
class Solution {
public:
vector<vector<int>> combinationSum3(int k, int n) {
vector<vector<int>> ans;
vector<int> path;
int s = 0;
dfs(ans,path,0,k,s,n);
return ans;
}
void dfs(vector<vector<int>>& ans,vector<int>& path,int num,int K,int& s,int& sum){
if(s > sum) return ;
if(K == 0 ){
if(s==sum) ans.push_back(path);
return ;
}
for(int i=num+1;i<10;i++){
path.push_back(i);
s += i;
dfs(ans,path,i,K-1,s,sum);
path.pop_back();
s -= i;
}
}
};
// @lc code=end
No.239 - LeetCode [216] Combination Sum III - 1到9和等于定值的所有情况
最新推荐文章于 2024-09-21 10:02:17 发布