39. Combination Sum

最新推荐文章于 2016-09-13 22:40:23 发布

varcom

最新推荐文章于 2016-09-13 22:40:23 发布

阅读量175

点赞数

分类专栏： leetcode-array

本文链接：https://blog.csdn.net/varcom/article/details/52382031

版权

leetcode-array 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

回溯

class Solution {
public:
    void Getans(vector<int>& nums,int sta,vector<vector<int>>& res,int cur,vector<int> ans,int target)
    {
        if(cur==target&&ans.size()>0)
        {
            res.push_back(ans);
            return;
        }
        if(nums[sta]>target||nums[sta]+cur>target||sta>=nums.size())
            return;
        
        Getans(nums,sta+1,res,cur,ans,target);
        ans.push_back(nums[sta]);
        Getans(nums,sta,res,cur+nums[sta],ans,target);
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        int n=candidates.size();
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> res;
        vector<int> ans;
        Getans(candidates,0,res,0,ans,target);
        return res;
    }
};

update:

class Solution {
public:
    void Getans(vector<int>& nums,int sta,vector<vector<int>>& res,int cur,vector<int> ans,int target)
    {
        if(cur==target&&ans.size()>0)
        {
            res.push_back(ans);
            return;
        }
        if(cur>target)
            return;
        for(int i=sta;i<nums.size();i++)
        {
            ans.push_back(nums[i]);
            Getans(nums,i,res,cur+nums[i],ans,target);   
            ans.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        int n=candidates.size();
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> res;
        vector<int> ans;
        Getans(candidates,0,res,0,ans,target);
        return res;
    }
};