Leetcode 39. 组合总和

朴素回溯

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> path;

    void dfs(vector<int>& nums, int target, int index) {
        if (index == nums.size()) 
            return ;
        if (target == 0) {
            ans.push_back(path);
            return ;
        }

        // 不用index数
        dfs(nums, target, index + 1);
        // 用index数
        if (target - nums[index] >= 0) {
            path.push_back(nums[index]);
            dfs(nums, target - nums[index], index);
            path.pop_back();
        }
    }

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

剪枝

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> path;

    void dfs(vector<int>& nums, int target, int index) {
        if (index == nums.size()) 
            return ;
        if (target == 0) {
            ans.push_back(path);
            return ;
        }

        // 不用index数
        dfs(nums, target, index + 1);
        // 用index数
        if (target - nums[index] >= 0) {
            path.push_back(nums[index]);
            dfs(nums, target - nums[index], index);
            path.pop_back();
        }
        else {
            return ;
        }

    }

    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        dfs(candidates, target, 0);
        return ans;
    }
};

回溯剪枝2

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> path;

    void dfs(vector<int>& nums, int target, int start) {
        if (start == nums.size()) 
            return ;
        if (target == 0) {
            ans.push_back(path);
            return ;
        }
        for (int i = start; i < nums.size(); i++) {
            if (target - nums[i] < 0) continue;
            path.push_back(nums[i]);
            dfs(nums, target - nums[i], i);
            path.pop_back();
        }
    }

    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        dfs(candidates, target, 0);
        return ans;
    }
};