hacktoberfest2022/Subsets.cpp at main · GDSCTINT/hacktoberfest2022 · 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
#include<bits/stdc++.h>
using namespace std;
void generate(vector<int> &nums, int i,vector<int> &subset,vector<vector<int>> &res)
    {
        if(i==nums.size())
        {
            res.push_back(subset);
            return;
        }
        else
        {
            generate(nums,i+1,subset,res);
            subset.push_back(nums[i]);
            generate(nums,i+1,subset,res);
            subset.pop_back();
        }

    }
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<int> subset;
        vector<vector<int>> res;

        generate(nums,0,subset,res);
        return res;

    }
int main(){

    vector<int> nums={1,2,3,4,5};

    vector<vector<int>> ans = subsets(nums);

    for(int i=0;i<ans.size();i++)
    {
        cout<<"[";
        for(int j=0;j<ans[i].size();j++)
        {
            if(j!=ans[i].size()-1)
            {cout<<ans[i][j]<<",";}
            else
            {
                cout<<ans[i][j];
            }
        }
        cout<<"]"<<endl;
    }
}