Leetcode 77. Combinations | | Leetcode 77. Combinations 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution123456789101112131415161718192021222324class Solution {public: vector<vector<int>> combine(int n, int k) { vector<vector<int>> result; vector<int> combination; combine(result, combination, n, k, 1); return result; } void combine(vector<vector<int>>& result, vector<int>& combination, int& n, int& k, int begin) { if(n - begin + 1 + combination.size() < k) { return; } if(combination.size() == k) { result.push_back(combination); return; } for(int i = begin; i <= n; i++) { combination.push_back(i); combine(result, combination, n, k, i + 1); combination.pop_back(); } }}; Reference https://leetcode.com/problems/combinations/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏