LeetCode/Combination Sum II.cpp at master · fuwutu/LeetCode · 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
class Solution
{
public:
    vector<vector<int>> combinationSum2(vector<int>& num, int target)
    {
        sort(num.begin(), num.end());

        set<vector<int>> result_set;
        vector<vector<int>> combination({{}});
        for (int n : num)
        {
            size_t count = combination.size();
            for (size_t i = 0; i < count; ++i)
            {
                int sum = accumulate(combination[i].begin(), combination[i].end(), 0);
                if (sum + n < target)
                {
                    combination.push_back(combination[i]);
                    combination.back().push_back(n);
                }
                else if (sum + n == target)
                {
                    auto x = combination[i];
                    x.push_back(n);
                    result_set.insert(x);
                }
            }
        }

        vector<vector<int>> result;
        for (auto& x : result_set)
        {
            result.push_back(x);
        }

        return result;
    }
};

//============================================================

class Solution2
{
public:
    vector<vector<int>> combinationSum2(vector<int>& num, int target)
    {
        sort(num.begin(), num.end());

        vector<vector<int>> result;
        vector<vector<int>> combination({{}});
        for (int n : num)
        {
            size_t count = combination.size();
            for (size_t i = 0; i < count; ++i)
            {
                int sum = accumulate(combination[i].begin(), combination[i].end(), 0);
                if (sum + n < target)
                {
                    combination.push_back(combination[i]);
                    combination.back().push_back(n);
                }
                else if (sum + n == target)
                {
                    result.push_back(combination[i]);
                    result.back().push_back(n);
                }
            }
        }

        sort(result.begin(), result.end());
        result.erase(unique(result.begin(), result.end()), result.end());

        return result;
    }
};