回溯理论
77. 组合
class Solution {
vector<vector<int>> result;
private:
void back_tracking(int n, int k, int starIndex,vector<int> path) {
if (path.size() == k) {
result.push_back(path);
return;
}
for (int i = starIndex; i <= n; i++) {
path.push_back(i);
back_tracking(n, k, i + 1, path);//注意这里是i+1
path.pop_back();
}
}
public:
vector<vector<int>> combine(int n, int k) {
vector<int> path;
back_tracking(n, k , 1, path);
return result;
}
};