leetcode 77. 组合 c++ 2021-07-10

这是一个回溯题

class Solution {
private:
    vector<int> path;
    vector<vector<int>> result;
    int startIndex;
    void backTracking (int n, int k, int startIndex)
    {
        if (path.size() == k)
        {
            result.push_back(path);
            return;
        }
        //for (int i = startIndex; i <= n; i++)  这么写就是没剪枝的 
        for (int i = startIndex; i <= (n - (k - path.size()) + 1); i++)//这么写就是剪枝的
        {
            path.push_back(i);
            backTracking(n, k, i + 1);
            path.pop_back();
        }
    }
public:
    vector<vector<int>> combine(int n, int k) 
    {
        path.clear();
        result.clear();
        backTracking(n, k, 1);
        return result;
    }
};