OpenEmailGenerator/Combination Sum II.cpp at main · wahyuhjr/OpenEmailGenerator · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
// Normal solution where repeated element present
/*
	Output:- [[1,2,5],[1,7],[1,6,1],[2,6],[2,1,5],[7,1]]
	Expected:- [[1,1,6],[1,2,5],[1,7],[2,6]]
*/

// you can use hashset to remove duplicate
class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {

        vector<vector<int>> res;
        vector<int> curr;

        generateSubsets(0, candidates, curr, res, target);
        return res;
    }

    void generateSubsets(int index, vector<int> candidates, vector<int> curr, vector<vector<int>> &res, int target){

        if(target==0){
            res.push_back(curr);
            return;
        }


        for(int i=index; i<candidates.size(); i++){
            curr.push_back(candidates[i]);
            generateSubsets(i+1, candidates, curr, res, target-candidates[i]);
            curr.pop_back();
        }

    }
};

// TLE
class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {

        vector<vector<int>> res;
        vector<int> curr;
        sort(candidates.begin(), candidates.end());
        generateSubsets(0, candidates, curr, res, target);
        return res;
    }

    void generateSubsets(int index, vector<int> candidates, vector<int> curr, vector<vector<int>> &res, int target){

        if(target==0){
            res.push_back(curr);
            return;
        }


        for(int i=index; i<candidates.size(); i++){
            if(i>index && candidates[i]==candidates[i-1])
                continue; // skipping same elements
            curr.push_back(candidates[i]);
            generateSubsets(i+1, candidates, curr, res, target-candidates[i]);
            curr.pop_back();
        }

    }
};

// Accepted
class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {

        vector<vector<int>> res;
        vector<int> curr;
        sort(candidates.begin(), candidates.end());
        generateSubsets(0, candidates, curr, res, target);
        return res;
    }

    void generateSubsets(int index, vector<int> candidates, vector<int> curr, vector<vector<int>> &res, int target){

        if(target==0){
            res.push_back(curr);
            return;
        }

        if(target<0) return;

        for(int i=index; i<candidates.size(); i++){
            if(i>index && candidates[i]==candidates[i-1])
                continue; // skipping same elements
            curr.push_back(candidates[i]);
            generateSubsets(i+1, candidates, curr, res, target-candidates[i]);
            curr.pop_back();
        }

    }
};