Subsets Problem


Description

LeetCode Problem 78.

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:

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

Example 2:

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

Constraints:

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


Sample C++ Code

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
class Solution {
public:
    int n;
    vector<vector<int>> ans;
    
    void dfs(int idx, vector<int>& state, vector<int>& nums) {
        if (idx == n) {
            vector<int> s;
            for (int i = 0; i < n; i ++) {
                if (state[i] == 1)
                    s.push_back(nums[i]);
            }
            ans.push_back(s);
            return;
        }
        
        state[idx] = 0;
        dfs(idx+1, state, nums);
        
        state[idx] = 1;
        dfs(idx+1, state, nums);
    }
    
    vector<vector<int>> subsets(vector<int>& nums) {
        n = nums.size();
        vector<int> state(n, 0);
        
        dfs(0, state, nums);
        
        return ans;
    }
};




Related Posts

Unique Paths III Problem

LeetCode 980. You are given an m x n integer...

Split Array Into Fibonacci Sequence Problem

LeetCode 842. You are given a string of digits num,...

Partition To K Equal Sum Subsets Problem

LeetCode 698. Given an integer array nums and an integer...

Letter Case Permutation Problem

LeetCode 784. Given a string s, we can transform every...

24 Game Problem

LeetCode 679. You are given an integer array cards of...

Matchsticks To Square Problem

LeetCode 473. You are given an integer array matchsticks where...