代码随想录算法训练营第24天|77. 组合

77. 组合

题目链接

77. 组合

我的题解

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