子集
给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: nums = [1,2,3]
输出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
思路和代码
递归和回溯
class Solution {
public:
vector<vector<int>> res;
vector<vector<int>> subsets(vector<int>& nums) {
vector<int> temp;
int cur = 0;
core(nums, cur, temp);
return res;
}
void core(vector<int>& nums, int cur, vector<int> temp){
if(cur == nums.size()){
res.push_back(temp);
return ;
}
temp.push_back(nums[cur]);
core(nums, cur+1, temp);
temp.pop_back();
core(nums, cur+1, temp);
}
};
下面这种代码运行起来更高效
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> res;
vector<int> temp;
sort(nums.begin(), nums.end());
backtrack(nums, 0, temp, res);
return res;
}
void backtrack(vector<int>& nums, int start, vector<int> temp, vector<vector<int>>& res)
{
res.push_back(temp);
for(int i=start; i<nums.size(); i++)
{
temp.push_back(nums[i]);
backtrack(nums, i+1, temp, res);
temp.pop_back();
}
}
};
子集2
相比于上一题,这一题数组会包含重复元素,只需要在遍历到一个元素,先判断是否和之前元素相等,若相等,直接跳过即可。
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> res;
vector<int> temp;
sort(nums.begin(), nums.end());
backtrack(nums, 0, temp, res);
return res;
}
void backtrack(vector<int>& nums, int start, vector<int> temp, vector<vector<int>>& res)
{
res.push_back(temp);
for(int i=start; i<nums.size(); i++)
{
if(i>start && nums[i]==nums[i-1])
continue;
temp.push_back(nums[i]);
backtrack(nums, i+1, temp, res);
temp.pop_back();
}
}
};