Combination Sum

最新推荐文章于 2025-05-25 18:32:47 发布

weixin_34417814

最新推荐文章于 2025-05-25 18:32:47 发布

阅读量49

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/winscoder/p/3535467.html

本文介绍了一种寻找候选数集合中所有唯一组合的算法，这些组合的和等于目标数。算法允许同一候选数被重复选择，并确保组合按非递减顺序排列且不包含重复项。代码实现使用了C++。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited number of times.

Note:

All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.

For example, given candidate set 2,3,6,7 and target 7,
A solution set is:
[7]
[2, 2, 3]

Code:

class Solution {
public:
    void findSum(vector<int> &S,int sum,int level,int &t,vector<int> &buf,vector<vector<int>> &res){
        for(int i=level;i<S.size();i++){
            buf.push_back(S[i]);
            if(sum+S[i]==t)
                res.push_back(buf);
            if(sum+S[i]<=t)
                findSum(S,sum+S[i],i,t,buf,res);
            buf.pop_back();
        }
    }
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        vector<int> buf;
        vector<vector<int>> res;
        sort(candidates.begin(),candidates.end());
        findSum(candidates,0,0,target,buf,res);
        return res;
    }
};

转载于:https://www.cnblogs.com/winscoder/p/3535467.html