Combination Sum

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

Albahaca

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

阅读量357

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/sunyujia19/article/details/12830727

版权

Leetcode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

DFS: almost the same, except the change of depth

class Solution {
public:
    void dfs(vector<int> &num, int target, int start, vector<int> &cur, vector<vector<int> > &res) {
        if (start>num.size()-1) return;
        for (int i=start; i<num.size(); i++) {
            int next_target=target-num[i];
            if (next_target==0) {
                cur.push_back(num[i]);
                res.push_back(cur);
                cur.pop_back();
                return;
            }
            if (next_target>0) {
                cur.push_back(num[i]);
                dfs(num, next_target,i, cur, res);
                cur.pop_back();
            }
        }
    }
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        vector<vector<int> > res;
        if (candidates.size()==0) return res;
        vector<int> cur;
        sort(candidates.begin(), candidates.end());
        dfs(candidates, target, 0, cur, res);
        return res;
    }
};

II:

Terminal condition: depth==num. size ()

Depth in next round = i+1 (! = depth + 1)

class Solution {
public:
    void dfs(vector<int> &num, int target, int start, vector<int> &cur, vector<vector<int> > &res) {
        if (start>num.size()-1) return;
        int temp=-1;
        for (int i=start; i<num.size(); i++) {
            if (temp==num[i]) continue;
            temp=num[i];
            int next_target=target-temp;
            if (next_target==0) {
                cur.push_back(temp);
                res.push_back(cur);
                cur.pop_back();
                return;
            }
            if (next_target>0) {
                cur.push_back(temp);
                dfs(num, next_target,i+1, cur, res);
                cur.pop_back();
            }
        }
    }
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        vector<vector<int> > res;
        if (num.size()==0) return res;
        vector<int> cur;
        sort(num.begin(), num.end());
        dfs(num, target, 0, cur, res);
        return res;
    }
};