39. Combination Sum(一个array中找到和是target的数组,array中的值可以重复)

最新推荐文章于 2021-03-05 08:50:53 发布

unshaven111

最新推荐文章于 2021-03-05 08:50:53 发布

阅读量209

点赞数

分类专栏：回溯文章标签： 39

本文链接：https://blog.csdn.net/qq_38251888/article/details/83781588

版权

回溯专栏收录该内容

6 篇文章 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]
]
vector pop_back() 删除最后一个元素
思想是:用递归的思想,从开始或者最后遍历,当remain==0时,把temp这个vector存进结果中，并且还要删除最后一个元素

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        //unordered_set<vector<int>> set;
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> res;
        vector<int> temp;
        int right = candidates.size()-1;
        returnVector(candidates,target,res,temp,right);
        return res;
    }
    void returnVector(vector<int>& nums,int remain,vector<vector<int>> &res,vector<int> &temp,int right){
        if(remain<0) return;
        else if(remain==0) res.push_back(temp);
        else{
            for(int i=right;i>=0;i--){
                temp.push_back(nums[i]);
                returnVector(nums,remain-nums[i],res,temp,i);
                temp.pop_back();
            }
        }
    }
};