摘要: 组合总和 点击查看代码 class Solution { public: vector<vector<int>> result; vector<int> path; void backtracking(vector<int>& candidates, int &target, int sum, in 阅读全文
posted @ 2025-03-05 23:23 coder小杰 阅读(17) 评论(0) 推荐(0)
摘要: 77.组合 解法一:不隐藏回溯 点击查看代码 class Solution { public: vector<vector<int>> result; vector<int> path; void backtracking(int n, int k, int startIndex) { if(pat 阅读全文
posted @ 2025-03-05 12:38 coder小杰 阅读(17) 评论(0) 推荐(0)