力扣 77.组合
题目链接:77. 组合 - 力扣(LeetCode)
思路:i<=n-(k-path.size())+1剪枝优化
C++代码:
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(int n,int k,int startindex){
if(path.size()==k){
result.push_back(path);
return;
}
for(int i=startindex;i<=n;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;
}
};