leetcode--Combination Sum

最新推荐文章于 2021-03-18 11:37:34 发布

longhopefor

最新推荐文章于 2021-03-18 11:37:34 发布

阅读量642

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/longhopefor/article/details/22733455

版权

leetcode 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

Problem Description:

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]

思路分析：利用深度优先算法不断遍历即可得到所有结果。

代码如下：

class Solution {
public:
    void dfs(vector<int> &candidates,int target,int start,vector<vector<int> > &results,vector<int> &subset)
    {
        if(target==0)
        {
            results.push_back(subset);
            return;
        }
        if(target<0) 
            return;
        for(size_t i=start;i!=candidates.size();++i)
        {
            if(target<candidates[i]) //剪枝
                return;
            subset.push_back(candidates[i]);
            dfs(candidates,target-candidates[i],i,results,subset);
            subset.pop_back();
        }
        
    }


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