class Solution {
public:
vector<int> path;
vector<vector<int>> res;
void backtrack(int n, int k, int startIndex)
{
if (path.size() == k)
{
res.push_back(path);
return;
}
else
{
for (int i = startIndex; i <= n; i++)
{
path.push_back(i);
backtrack(n, k, i + 1);
path.pop_back();
}
}
}
vector<vector<int>> combine(int n, int k) {
backtrack(n, k, 1);
return res;
}
};
LeetCode77.组合
最新推荐文章于 2024-07-20 09:51:47 发布