Problem-Solving-in-any-Language/Subsets.cpp at main · hk513/Problem-Solving-in-any-Language · 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
// 78. Leetcode  {MEDIUM}  [Array, Backtracking]

#include <bits/stdc++.h>
using namespace std;

class Solution
{
public:
    vector<vector<int>> allsubset;

    void generate(vector<int> &tempset, int i, vector<int> &nums)
    {

        if (i == nums.size())
        {
            allsubset.push_back(tempset);
            return;
        }

        // ith element not included in subset
        generate(tempset, i + 1, nums);

        // ith element to be included in subset
        tempset.push_back(nums[i]);
        generate(tempset, i + 1, nums);
        tempset.pop_back();
    }

    vector<vector<int>> subsets(vector<int> &nums)
    {

        vector<int> empty;
        generate(empty, 0, nums);
        sort(allsubset.begin(), allsubset.end());
        return allsubset;
    }
};