LeetCode Combinations

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> > ret;
		for(int i = 1; i <= n; ++i)
		{
			ret.push_back(vector<int>());
			ret.back().push_back(i);
		}
		for(int i = 1; i < k; ++i)
		{
			ret = GetNext(n, ret);
		}
        
		return ret;
    }

	vector<vector<int> > GetNext(int n, vector<vector<int> >& cur)
	{
		vector<vector<int> > ret;
		for(int i = 0; i < cur.size(); ++i)
		{
			for(int j = cur[i].back() + 1; j <= n; ++j)
			{
				ret.push_back(cur[i]);
				ret.back().push_back(j);
			}
		}

		return ret;
	}
};