leetCode77. 组合

leetCode77. 组合

代码

class Solution {
public:

    vector<vector<int>> res ; // 答案数组
    vector<int> path;
    vector<vector<int>> combine(int n, int k) {
        dfs(n, k, 1);

        return res;
    }

    void dfs(int n, int k, int start){
        if(!k){
            res.push_back(path);
            return;
        }

        for(int i = start; i <= n; i++ ){
            path.push_back(i);
            dfs(n, k - 1, i + 1);
            path.pop_back();
        }
    }
};