LeetCode题解——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.

Ensure that numbers within the set are sorted in ascending order.

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

backtracking 

class Solution {
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        vector<vector<int>> ans;
        vector<int> temp;
        combinationSum3(k,n,ans,temp,1);
        return ans;
    }
private:
    void combinationSum3(int k ,int n, vector<vector<int>> &ans, vector<int> &temp, int begin){
        if(!k){
            if(!n) ans.push_back(temp);
            return;
        }
        for(int i=begin; i<=9;i++){
            temp.push_back(i);
            combinationSum3(k-1,n-i,ans,temp,i+1);
            temp.pop_back();
        }
    }
    
};