LeetCode-039：Combination Sum

最新推荐文章于 2020-09-11 09:49:19 发布

临渊行

最新推荐文章于 2020-09-11 09:49:19 发布

阅读量129

点赞数

分类专栏： LeetCode 文章标签： dfs

本文链接：https://blog.csdn.net/qq_32360995/article/details/86762293

版权

LeetCode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

题目：

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

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

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
  [7],
  [2,2,3]
]

Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
  [2,2,2,2],
  [2,3,3],
  [3,5]
]

题意：

找出数组中任意个元素的和为target的集合

思路：

递归查找没得说的题（注意一个数可多次选取）

Code：

class Solution {
public:
    vector<vector<int>> q;
    vector<int> t;
    int len;
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        len=candidates.size();
        dfs(0,0,target,candidates);
        return q;
    }
    void dfs(int start,int sum,int target,vector<int> candidates){
        if(sum==target){
            q.push_back(t);
            return;
        }
        else if(sum>target) return;
        else{
            for(int i=start;i<len;i++){
                t.push_back(candidates[i]);
                dfs(i,sum+candidates[i],target,candidates);
                t.pop_back();
            }
        }
    }
};