« back

Subsets

Tags : array, bitmasks, backtracking, leetcode, cpp, medium

Problem Statement - link #

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.

Examples #

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 #

Solutions #

class Solution {
public:

    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        for(int i=0; i<pow(2,nums.size()); i++){
            vector<int> ss;
            for(int j=0; j<nums.size(); j++)
                if(i&(1<<j)) ss.push_back(nums[j]);
            res.push_back(ss);
        }
        return res;
    }
};