【DFS】LeetCode 39. Combination Sum

最新推荐文章于 2023-05-22 12:05:46 发布

Allenlzcoder

最新推荐文章于 2023-05-22 12:05:46 发布

阅读量202

点赞数

分类专栏： LeetCode练习题文章标签： LeetCode 39. Combination Sum

本文链接：https://blog.csdn.net/Allenlzcoder/article/details/81069661

版权

LeetCode练习题专栏收录该内容

168 篇文章 1 订阅

订阅专栏

LeetCode 39. Combination Sum

Solution1:
DFS，这个套路要熟记啊！

class Solution {
public:
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        vector<vector<int> > res;
        vector<int> out;
        sort(candidates.begin(), candidates.end());
        combinationSumDFS(candidates, target, 0, out, res);
        return res;
    }
    void combinationSumDFS(vector<int> &candidates, int target, 
                           int start, vector<int> &out, vector<vector<int> > &res) {
        if (target < 0) return;
        else if (target == 0) res.push_back(out);
        else {
            for (int i = start; i < candidates.size(); ++i) {
                out.push_back(candidates[i]);
                combinationSumDFS(candidates, target - candidates[i], i, out, res);
                out.pop_back();
            }
        }
    }
};