题目描述:
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;
vector<int> path;
recusive(ret, n, k, 1, path);
return ret;
}
void recusive(vector<vector<int>> &ret, int n, int k, int i, vector<int> &path){
if (k == 0)
ret.push_back(path);
if (k <= 0 || i > n)
return;
for (; i <= n; i++){
path.push_back(i);
recusive(ret, n, k - 1, i + 1, path);
path.pop_back();
}
}
};
这是刷的最后一道LeetCode题目了,终于结束了。