题目描述
解法
先不考虑效率,这道题就是一个典型回溯框架可以解决的问题,详细可以参考 LeetCode 78. 子集
class Solution {
public:
vector<vector<int>> res;
vector<vector<int>> combine(int n, int k) {
vector<int> track;
backtrace(1, n, k, track);
return res;
}
void backtrace(int start, int n, int k, vector<int>& track)
{
if (track.size() == k)
{
res.push_back(track);
return;
}
for(int i = start; i <= n; i++)
{
track.push_back(i);
backtrace(i + 1, n, k, track);
track.pop_back();
}
}
};