[leetcode]Combination Sum

最新推荐文章于 2019-07-08 15:05:38 发布

原创最新推荐文章于 2019-07-08 15:05:38 发布 · 961 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法

算法专栏收录该内容

146 篇文章

订阅专栏

本文探讨了给定一组候选数和目标数时如何找出所有可能的组合，使得这些候选数的和等于目标数。采用回溯法求解，并提供详细的C++代码实现，确保解决方案的唯一性和非递减顺序。

问题描述：

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

The same repeated number may be chosen fromC unlimited number of times.

Note:

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

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

基本思路：

回溯法求解。具体请参见代码。

代码：

class Solution {  //C++
public:
    vector<int> record;
    vector<vector<int> >result;
    set<vector<int> > myset;
    
    void addSolution(){
        vector<int> tmp(record.begin(),record.end());
        sort(tmp.begin(),tmp.end());
        if(myset.find(tmp) == myset.end()){
            result.push_back(tmp);
            myset.insert(tmp);   
        }
    }
    void subCombinationSum(vector<int> &cadidates, int target,int bpos){
        if(target ==0 ){
            addSolution();
        }
        
        int size = cadidates.size();
        for(int i = bpos; i < size&&cadidates[i] <= target; i++){
            record.push_back(cadidates[i]);
            subCombinationSum(cadidates,target-cadidates[i],bpos);
            record.pop_back();
        }
    }
    
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        sort(candidates.begin(),candidates.end());
        subCombinationSum(candidates,target,0);
        return result;
    }
};