【40】78. Subsets

78. Subsets

Description Submission Solutions Add to List

• Total Accepted: 140573
• Total Submissions: 377635
• Difficulty: Medium
• Contributors: Admin

Given a set of distinct integers, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> level;
        dfs(nums, 0, res, level);
        return res;
    }
    
    void dfs(vector<int>& nums, int start, vector<vector<int>>& res, vector<int>& level){
        res.push_back(level);
        for(int i = start; i < nums.size(); i++){
            level.push_back(nums[i]);
            dfs(nums, i + 1, res, level);
            level.pop_back();
        }
    }
};