题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:带你学透回溯算法-组合问题(对应力扣题目:77.组合)| 回溯法精讲!_哔哩哔哩_bilibili
状态:通过
代码实现:
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backTracking(int n, int k, int startIndex){
if(path.size() == k){
result.push_back(path);
return;
}
for(int i = startIndex; i <= n - (k - path.size()) + 1; i++){
path.push_back(i);
backTracking(n, k, i + 1);
path.pop_back();
}
};
public:
vector<vector<int>> combine(int n, int k) {
result.clear();
path.clear();
backTracking(n, k, 1);
return result;
}
};