39. Combination Sum（medium）

最新推荐文章于 2025-01-13 15:16:10 发布

原创最新推荐文章于 2025-01-13 15:16:10 发布 · 150 阅读

0 ·

CC 4.0 BY-SA版权

回溯专栏收录该内容

5 篇文章

订阅专栏

本文详细解析了组合求和问题的两种解决方案：回溯法和官方思路。通过递归实现，利用剪枝优化搜索过程，确保高效找出所有可能的组合。

Combination Sum
Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.
The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.
It is guaranteed that the number of unique combinations that sum up to target is less than 150 combinations for the given input.

1.回溯
cur存放当前选择的序列，在combinationSum函数中，for循环用来选择每次开始的元素，并加入cur，递归回溯。combination函数分别有三个参数，candidates，begin：当前选择开始下标，target。从下标begin开始，依次加入cur。target=0时，结束递归。

剪枝：

candidates数组从小到大排列，candidates[begin]>target时，后面所有元素都不满足要求，剪枝。

    vector<vector<int>>res;
    vector<int>cur;
    void combination(vector<int>& candidates, int begin,int target){
        if(target==0){
            res.push_back(cur);
            return;
        }
        if(candidates[begin]>target){
            return;
        }        
        for(int i=begin;i<candidates.size();i++){
			if(candidates[i]>target){
				break;
			}
            cur.push_back(candidates[i]);
            combination(candidates,i,target-candidates[i]);
            cur.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        for(int i=0;i<candidates.size();i++){
			cur.push_back(candidates[i]);
            combination(candidates,i,target-candidates[i]);
			cur.pop_back();
        }
        return res;
    }

2.官方思路（为了方便自己理解，做了一点小改动）
没有迭代
先判断能否加入candidates[begin]，回溯之后再判断begin+1的情况

    vector<vector<int>>res;
    vector<int>cur;
    void dfs(vector<int>& candidates, int begin,int target){
        if(target==0){
            res.push_back(cur);
            return;
        }
        if(begin==candidates.size()||candidates[begin]>target){
            return;
        }
        cur.push_back(candidates[begin]);
        dfs(candidates,begin,target-candidates[begin]);
        cur.pop_back();
        dfs(candidates,begin+1,target);
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        dfs(candidates,0,target);
        return res;
    }