[leetcode] 216. Combination Sum III

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.

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]]

解法一：

粗略的思路是有，不过还是属于看到答案还要想半天的。。。这里的pop_back()用的太巧了。

class Solution {
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        vector<int> out;
        vector<vector<int> > res;
        combinationSumDFS(k,n,1,out,res);
        return res;
        
        
    }
    
    void combinationSumDFS(int k, int n, int level, vector<int> &out, vector<vector<int> > &res){
        if(n<0) return;
        if(n==0 && out.size()==k) res.push_back(out);
        
        for(int i=level; i<=9; i++){
            out.push_back(i);
            combinationSumDFS(k,n-i,i+1,out,res);
            out.pop_back();
        }
        
    }
};