216. Combination Sum III

题目描述

216. Combination Sum III

回溯+剪枝

class Solution {
    vector<vector<int>> res;
    vector<int> com;
    int sum = 0;
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        if(n > 45)//1+2+3+...+9=45
            return res;
        backtracking(k,n,1);
        return res;
    }

    void backtracking(int k,int n,int start){
        if(com.size() == k){
            if(sum == n)
                res.push_back(com);
            return;
        }

        if(sum + start > n)
            return;
        for(int i = start;i <=9;i++){
            if(sum + i > n)
                continue;
            com.push_back(i);
            sum+=i;
            backtracking(k,n,i+1);
            com.pop_back();
            sum-=i;
        }
    }
};

剪枝二

class Solution {
    vector<vector<int>> res;
    vector<int> com;
    int sum = 0;
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        if(n > 45)//1+2+3+...+9=45
            return res;
        backtracking(k,n,1);
        return res;
    }

    void backtracking(int k,int n,int start){
        if(com.size() == k){
            if(sum == n)
                res.push_back(com);
            return;
        }

        if(sum + start > n)
            return;
        for(int i = start;i <=min(9,n-sum);i++){
            com.push_back(i);
            sum+=i;
            backtracking(k,n,i+1);
            com.pop_back();
            sum-=i;
        }
    }
};