class Solution {
public:
vector<vector<int>> ret;
set<vector<int>> s;
void dfs(vector<int>& nums,vector<int> path,int idx)
{
if(idx==nums.size())
{
if(!s.count(path))
{
s.insert(path);
ret.push_back(path);
}
return;
}
for(int i = idx;i<nums.size();i++)
{
if(i>idx&&nums[i]==nums[i-1]) continue;
path.push_back(nums[i]);
dfs(nums,path,i+1);
path.pop_back();
dfs(nums,path,i+1);
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums)
{
vector<int> path;
sort(nums.begin(),nums.end());
dfs(nums,path,0);
return ret;
}
};
个人写法,非最优解