[LeetCode]216. 组合总和 III

216. 组合总和 III

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> temp;
    int tip;
    void solve(int x,int y,int tot){
        if (tot==0 && x>tip){
            ans.push_back(temp);
            return;
        }
        if (x>tip || y==9){
            return;
        }
        int help=min(9,tot);
        for (int i=y+1;i<=help;i++){
            temp.push_back(i);
            solve(x+1,i,tot-i);
            temp.erase(temp.end()-1);
        }
        //solve(x+1,y,tot);
    }
    vector<vector<int>> combinationSum3(int k, int n) {
        ans.clear();
        temp.clear();
        tip=k;
        solve(1,0,n);
        return ans;
    }
};