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