算法训练营 Day 21

1、组合

回溯法

class Solution {
private:
    vector<vector<int>> result; //二维结果数组
    vector<int> path; //一维结果数组
    void backtracking(int n, int k, int startIndex) {
        if (path.size() == k) { //终止条件
            result.push_back(path);
            return;
        }
        for (int i = startIndex; i <= n; ++i) {
            path.push_back(i); // 处理节点
            backtracking(n, k, i + 1); // 递归
            path.pop_back(); // 回溯，撤销处理的节点
        }
    }

public:
    vector<vector<int>> combine(int n, int k) {
        backtracking(n, k, 1);
        return result;
    }
};

可以剪枝优化：

class Solution {
private:
    vector<vector<int>> result; //二维结果数组
    vector<int> path; //一维结果数组
    void backtracking(int n, int k, int startIndex) {
        if (path.size() == k) { //终止条件
            result.push_back(path);
            return;
        }
        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) {
        backtracking(n, k, 1);
        return result;
    }
};