第77题. 组合
https://leetcode.cn/problems/combinations/
本题卡哥在代码随想录中写的思路已经非常详细了,没什么好说的
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backTracking(int n, int k, int cur){
if(path.size() == k) {
result.push_back(path);
return;
}
for(int i = cur; i <= n - (k - path.size()) + 1; i++){
path.push_back(i);
backTracking(n, k, i + 1);
path.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
backTracking(n, k, 1);
return result;
}
};