搭建企业网站流程/百度平台推广联系方式

代码随想录算法训练营第37期 第二十四天 | LeetCode77. 组合

---

一、77. 组合

解题代码C++：

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; 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;}
};

题目链接/文章讲解/视频讲解：
https://programmercarl.com/0077.%E7%BB%84%E5%90%88.html