leetcode216. 组合总和 III

1、题目

https://leetcode-cn.com/problems/combination-sum-iii/

2、题意

题解1：递归回溯和组合总和12类似

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    void dfs(int start,int k,int tar)
    {
        if(k==0&&tar==0)
        {
            res.push_back(path);
            return ;
        }
        for(int i=start;i<=9;i++)
        {
            if(tar-i<0)
                break;
            path.push_back(i);
            dfs(i+1,k-1,tar-i);
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum3(int k, int n) {
        dfs(1,k,n);
        return res;
    }
};