leetcode_c++：Combination Sum III(216)

题目

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

---

算法

dfs
复杂度：O（n！）
还是回溯，每个数只能出现一次，每次递归都从当前数的下一个开始，当k==0&&n==0，就可以加入结果集。

---

class Solution {
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        vector<vector<int>> result;

        vector<int> item;
        helper(result, item, 0, k, n);

        return result;
    }

    //max是item中最大的那个数，left是还剩下的值，k是需要找的数目
    void helper(vector<vector<int>>& result, vector<int>& item, int max, int k, int left){
        if(item.size()==k&&left==0){
            result.push_back(item);
            return;
        }
        for(int i=max+1; i<=9&&i<=left; i++){
            item.push_back(i);
            helper(result, item, i, k, left-i);
            item.pop_back();
        }
    }
};