题目:
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],
]
代码1:
class Solution {
public:
void combineHelp(vector<vector<int> > &res, vector<int> &temp, int start, int n, int k)
{
if(k == 0)
{
res.push_back(temp);
return;
}
for(int i = start; i <= n; ++i)
{
temp.push_back(i);
combineHelp(res, temp, i+1, n, k-1);
temp.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
vector<vector<int> > res;
if(n < 1 || k < 1 || (n < k))
return res;
vector<int> temp;
combineHelp(res, temp, 1, n, k);
return res;
}
};
代码2:
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> result;
int i = 0;
vector<int> p(k, 0);
while (i >= 0)
{
p[i]++;
if (p[i] > n)
--i;
else if (i == k - 1)
result.push_back(p);
else
{
++i;
p[i] = p[i - 1];
}
}
return result;
}
};