Leetcode-DSA/subsets.cpp at main · Mayank-tech69/Leetcode-DSA · 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
class Solution {
    public:

        //helper function
        void allsubsets(vector<int>& nums, vector<int>& ans,int i,vector<vector<int>> &allsubs){
            if(i==nums.size()){
                allsubs.push_back({ans});
                return;
            }
            //inclusion
            ans.push_back(nums[i]);
            allsubsets(nums,ans,i+1,allsubs);

            //exclusion
            ans.pop_back();
            allsubsets(nums,ans,i+1,allsubs);
        }

        vector<vector<int>> subsets(vector<int>& nums) {
            vector<vector<int>> allsubs;
            vector<int> ans;
            allsubsets(nums,ans,0,allsubs);
            return allsubs;
        }

    };