77.组合
无重复数的组合问题
class Solution {
vector<vector<int>> res;
vector<int> path;
void trackback(int n, int k, int start)
{
if(path.size()==k)
{
res.push_back(path);
return;
}
for(int i = start; i<=n&&start<=n-(k-path.size())+1; i++)
{
path.push_back(i);
trackback(n, k, i+1);
path.pop_back();
}
return;
}
public:
vector<vector<int>> combine(int n, int k) {
res.clear();
path.clear();
if(n<k) return res;
else trackback(n, k, 1);
return res;
}
};