https://oj.leetcode.com/problems/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> > resultVec;
if (n <=0 || n < k) {
return resultVec;
}
vector<int> rowVec;
for (int i=1; i<=n-k+1; i++) {
rowVec.push_back(i);
combine(i, n, k-1, resultVec, rowVec);
rowVec.pop_back();
}
return resultVec;
}
private:
void combine(int prevNum, int n, int k, vector<vector<int> >& resultVec, vector<int>& rowVec) {
if (k == 0) {
resultVec.push_back(rowVec);
return;
}
for (int i=prevNum+1; i<=n-k+1; i++) {
rowVec.push_back(i);
combine(i, n, k-1, resultVec, rowVec);
rowVec.pop_back();
}
}
};