diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/combination_sum3.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/combination_sum3.cpp')
-rw-r--r-- | other/combination_sum3.cpp | 38 |
1 files changed, 0 insertions, 38 deletions
diff --git a/other/combination_sum3.cpp b/other/combination_sum3.cpp deleted file mode 100644 index bde03a3..0000000 --- a/other/combination_sum3.cpp +++ /dev/null @@ -1,38 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<vector<int>> combinationSum3(int k, int n) { - vector<vector<int>> ans; - vector<int> sol; - helper(ans, sol, k, n); - return ans; - } - void print(vector<vector<int>> &ans) { - for (int i = 0; i < ans.size(); i++) - for (int j = 0; j < ans.size(); j++) - cout << ans[i][j] << ' '; - } - -private: - void helper(vector<vector<int>> &ans, vector<int> sol, int k, int n) { - if (sol.size() == k && n == 0) { - ans.push_back(sol); - return; - } - if (sol.size() < k) - for (int i = sol.empty() ? 1 : sol.back() + 1; i <= 9; ++i) { - if (n - i < 0) - break; - sol.push_back(i); - helper(ans, sol, k, n - i); - sol.pop_back(); - } - } -}; - -int main() { - Solution obj; - vector<vector<int>> ans; - obj.print(ans); -} |