combinations

题目：

Given two integers n and k, return all possible combinations of k numbers out of 1 … n.
For example,
If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]

程序：

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

        vector<vector<int>> res;
        if(k>n)
            return res;
        solve(res,n,k,1);
        return res;
    }

    void solve(vector<vector<int>> &res,int n,int k,int beg)
    {
        if(k==0)
        {
            res.push_back(v);
            return;
        }

        for(int i=beg;i<=n;i++)
        {
            v.push_back(i);
            solve(res,n,k-1,i+1);
            v.pop_back();
        }
    }

    vector<int> v;
};

点评：

递归