Leetcode77

Combinations:
Given two integers n and k, return all possible combinations of k numbers out of 1 … n.
Example:
Input: n = 4, k = 2
Output:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]

Solution:

#include <iostream>
#include <vector>

using namespace std;

class Solution {

private:
    vector<vector<int>> res;

    // 求解C(n, k)，当前已经找到的组合存储在c中， 需要从start开始搜索新的元素
    void generatecambination(int n, int k, int start, vector<int> &c){

        if ( c.size() == k ){
            res.push_back(c);
            return;
        }

        for ( int i = start; i <= n; i++){
            c.push_back(i);
            generatecambination(n, k, i + 1, c);
            c.pop_back();
        }

        return;

    }
public:
    vector<vector<int>> combine(int n, int k) {

        res.clear();
        if ( n <= 0 || k <= 0 || k > n )
            return res;

        vector<int> c;
        generatecambination(n, k, 1, c);

        return res;

    }
};

Solution2(剪枝优化)：

#include <iostream>
#include <vector>

using namespace std;

class Solution {

private:
    vector<vector<int>> res;

    // 求解C(n, k)，当前已经找到的组合存储在c中， 需要从start开始搜索新的元素
    void generatecambination(int n, int k, int start, vector<int> &c){

        if ( c.size() == k ){
            res.push_back(c);
            return;
        }


        // for ( int i = start; i <= n; i++){
        // 剪枝优化
        // 还有k - c.size()个空位，所以，[i...n]中至少要有k - c.size()个元素
        // i最多为 n - (k - c.size()) + 1
        for (int i = start; i <= n - (k - c.size()) + 1; i++){
            c.push_back(i);
            generatecambination(n, k, i + 1, c);
            c.pop_back();
        }

        return;

    }
public:
    vector<vector<int>> combine(int n, int k) {

        res.clear();
        if ( n <= 0 || k <= 0 || k > n )
            return res;

        vector<int> c;
        generatecambination(n, k, 1, c);

        return res;

    }
};

总结： 这是组合问题