1、题目
https://leetcode-cn.com/problems/subsets-ii/
2、题意
题解1:和子集1类似 只需将数组排序 选2个及以上的时候判断相邻两个是否相等 相等则continue
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> res;
vector<int> path;
if (nums.size() == 0) {
return res;
}
sort(nums.begin(),nums.end());
dfs(nums,0, path, res);
return res;
}
private:
void dfs(vector<int> &nums,int start,vector<int> &path,vector<vector<int>> &res)
{
res.push_back(path);
for(int i=start;i<nums.size();i++)
{
if(i!=start&&nums[i]==nums[i-1]) continue;
path.push_back(nums[i]);
dfs(nums,i+1,path,res);
path.pop_back();
}
}
};