90. Subsets II

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,

If nums =

[1,2,2]

, a solution is:

[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]

Subscribe to see which companies asked this question

// static map<int,int> m1;
class Solution {
public:
void backtrack(int j, set<vector<int>>& s1,vector<int> temp,const vector<int>& nums)
{
if(temp.size()<=nums.size())
{
sort(temp.begin(),temp.end());
s1.insert(temp);
if(temp.size()==nums.size())
return ;
}
{
for(int i=j;i<nums.size();++i)
{
temp.push_back(nums[i]);
backtrack(i+1,s1,temp,nums);
temp.pop_back();
}
return ;
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
set<vector<int>> s1;
vector<int> temp;
s1.insert(temp);
for(int i= 0;i<nums.size();++i)
{
temp.push_back(nums[i]);
backtrack(i+1,s1,temp,nums);
temp.pop_back();
}
return vector<vector<int>>(s1.begin(),s1.end());
}
};