78. Subsets

 

78. Subsets

Medium

254762FavoriteShare

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

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

Accepted

442,905

Submissions

787,510

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