78. Subsets LeetCode

Raunit Verma November 12, 2021

78. Subsets

Given an integer array nums of unique elements, return all possible subsets (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

Example 1:

Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Example 2:

Input: nums = [0]
Output: [[],[0]]

Constraints:

1 <= nums.length <= 10
-10 <= nums[i] <= 10
All the numbers of nums are unique.

Solution in C++

class Solution {
public:
    vector<vector<int>>ans;
    void generate(vector<int> &subset, int i, vector<int>&nums){
        if(i==nums.size()){
            for(int j=0; j<ans.size(); j++){
                if(subset==ans[j]){
                    return;
                }
                else{
                   ans.push_back(subset);
            return; 
                }
            }
            
        }
        
         generate(subset,i+1, nums);
        
        subset.push_back(nums[i]);
        generate(subset,i+1,nums);
        subset.pop_back();
    }
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<int>subset;
        generate(subset,0,nums);
        return ans; 
    }
};