给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: nums = [1,2,3] 输出: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]
C++
class Solution {
public:
void DFS(vector<vector<int>>& res, vector<int>& tmp, vector<int>&nums, int k)
{
res.push_back(tmp);
if(k==nums.size())
{
return;
}
for(int i=k;i<nums.size();i++)
{
tmp.push_back(nums[i]);
DFS(res,tmp,nums,i+1);
tmp.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums)
{
vector<vector<int>> res;
vector<int> tmp;
DFS(res,tmp,nums,0);
return res;
}
};
python
class Solution:
def DFS(self,res,tmp,nums,k):
res.append(tmp.copy())
if k==len(nums):
return
for i in range(k,len(nums)):
tmp.append(nums[i])
self.DFS(res,tmp,nums,i+1)
del tmp[-1]
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res=[]
tmp=[]
self.DFS(res,tmp,nums,0)
return res