Combination Sum

最新推荐文章于 2021-02-23 05:50:14 发布

john_and_betty

最新推荐文章于 2021-02-23 05:50:14 发布

阅读量331

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/asasopo/article/details/22090391

版权

leetcode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

class Solution {
public:
    vector<vector<int>>res;
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        vector<int>path;
        combination(candidates,target,path,0);
        return res;
    }
    void combination(vector<int>&candidates,int target,vector<int>&path,int sum)
    {
        if(target==sum)
        {
            res.push_back(path);
            return ;
        }
        for(int i=0;i<candidates.size();i++)
        {
            if(candidates[i]+sum<=target&&(path.size()==0||path.size()!=0&&path[path.size()-1]<=candidates[i]))
            {
                path.push_back(candidates[i]);
                combination(candidates,target,path,sum+candidates[i]);
                path.pop_back();
            }
        }
    }
};