LeetCode系列39—组合总和

题意

39. 组合总和

题解

两种思路的搜索回溯，一是根据一个数选或者不选，二是减去已选择的数

class Solution {
public:
    void dfs(vector<int>& candidates, int target, vector<vector<int>>& ans, vector<int>& combine, int idx) {
        if (idx == candidates.size()) {
            return;
        }
        if (target == 0) {
            ans.emplace_back(combine);
            return;
        }
        // 直接跳过
        dfs(candidates, target, ans, combine, idx + 1);
        // 选择当前数
        if (target - candidates[idx] >= 0) {
            combine.emplace_back(candidates[idx]);
            dfs(candidates, target - candidates[idx], ans, combine, idx);
            combine.pop_back();
        }
    }

    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> ans;
        vector<int> combine;
        dfs(candidates, target, ans, combine, 0);
        return ans;
    }
};

作者：LeetCode-Solution
链接：https://leetcode-cn.com/problems/combination-sum/solution/zu-he-zong-he-by-leetcode-solution/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> candidate;
        backtrack(candidates, 0, res, candidate, 0, target);
        return res;
    }

    void backtrack(vector<int>& candidates, int index, vector<vector<int>>& res, vector<int> candidate, int sum, int target) {
        if (sum == target) {
            res.push_back(candidate);         
        } else if (sum < target) {
            for (int i = index; i < candidates.size(); i++) {
                if (candidates[i] <= target) {
                    candidate.push_back(candidates[i]);
                    backtrack(candidates, i, res, candidate, sum+candidates[i], target);
                    candidate.pop_back();    
                }
            }
        }
    }
};

参考

组合总和
回溯算法 + 剪枝（回溯经典例题详解）