90. Subsets II

class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(),nums.end());
set<vector<int>> subs;//subs初始化只有一个空的vector<int>
subs.insert(vector<int>());
for(int i=0;i<nums.size();i++)
{
set<vector<int>> s;
for(set<vector<int>>::iterator it=subs.begin();it!=subs.end();it++)
{
vector<int> temp(*it);
temp.push_back(nums[i]);
s.insert(temp);
}
for(set<vector<int>>::iterator it=s.begin();it!=s.end();it++)
{
subs.insert(*it);
}
}
vector<vector<int>> ret(subs.begin(),subs.end());
return ret;
}
};