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],
[]
]
C++
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> res;
vector<int> item;
res.push_back(item);
DFS(res,item,nums,0);
return res;
}
void DFS(vector<vector<int>>& res,vector<int> item,vector<int>& nums,int start)
{
if(!item.empty())
res.push_back(item);
for(int i = start;i < nums.size();++i)
{
item.push_back(nums[i]);
DFS(res,item,nums,i+1);
item.pop_back();
}
}