题目描述:
给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: nums = [1,2,3]
输出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
算法1:
首先初始化空集合,res = [ [] ];
然后对 res 中的每个子数组,添加1后,新加到res中,res = [ [], [1] ] ;
然后添加2, res = [ [], [1], [2], [1,2] ]
同理,添加3: res = [ [], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3] ]
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>>res(1); // 添加空集合
sort(nums.begin(), nums.end());
for(int i=0; i<nums.size(); i++) // 依次插入每个数
{
int size = res.size();
for(int j=0; j<size; j++) // 对结果数组中的每个子数组进行操作
{
res.push_back(res[j]);
res.back().push_back(nums[i]);
}
}
return res;
}
};
算法2:
DFS
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>>ans;
ans.push_back({});
for(int i=1; i<=nums.size(); i++)
{
int index = 0;
vector<int>out;
vector<int>visit(nums.size(), 0);
dfs(nums, ans, i, index, out, visit);
}
return ans;
}
void dfs(vector<int>& nums, vector<vector<int>>& ans, int len, int index, vector<int>& out, vector<int>& visit)
{
if(out.size() == len)
{
// if(check(ans, out))
// ans.push_back(out);
ans.push_back(out);
return ;
}
for(int i=index; i<nums.size(); i++)
{
if(visit[i] == 0)
{
out.push_back(nums[i]);
visit[i] = 1;
dfs(nums, ans, len, i+1 ,out, visit);
out.pop_back();
visit[i] = 0;
}
}
}
};
更加简洁的版本参考:解法二:
class Solution {
public:
vector<vector<int> > subsets(vector<int> &S) {
vector<vector<int> > res;
vector<int> out;
sort(S.begin(), S.end());
getSubsets(S, 0, out, res);
return res;
}
void getSubsets(vector<int> &S, int pos, vector<int> &out, vector<vector<int> > &res) {
res.push_back(out);
for (int i = pos; i < S.size(); ++i) {
out.push_back(S[i]);
getSubsets(S, i + 1, out, res);
out.pop_back();
}
}
};