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

注意：结果中无重复数字，详情参考上一篇

class Solution {
    void helper(vector<vector<int> >&res,vector<int> &base,vector<int>&can,int k,int left){
        if(k==0){
            if(left==0)
                res.push_back(base);
            return ;
        }
        int max=base.empty()?INT_MIN:base.back();
        for(auto &e:can){
            if(e<=max)
                continue;
            if(e<=left){
                base.push_back(e);
                helper(res,base,can,k-1,left-e);
                base.pop_back();
            }else
                break;
        }
    }

public:
    vector<vector<int>> combinationSum3(int k, int n) {
        vector<vector<int> > res;
        if(k<=0||n<=0)
            return res;
        vector<int> can={1,2,3,4,5,6,7,8,9}; //自己拟定一个候选数组
        vector<int> base;
        helper(res,base,can,k,n);
        return res;   
  }
};