title
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:
Input: [1,2,2]
Output:
[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]
solution
class Solution {
public:
void f(vector<vector<int>> &v,int start,vector<int> &t,vector<int>& nums){
//if(start==nums.size()) return;
v.push_back(t);
for(auto it:t){
cout<<it<<" ";
}
cout<<endl;
for(int i=start;i<nums.size();i++){
if(i>start&&nums[i]==nums[i-1]){
continue;
}
t.push_back(nums[i]);
f(v,i+1,t,nums);
t.pop_back();
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<vector<int>> v;
sort(nums.begin(),nums.end());
vector<int> t;
f(v,0,t,nums);
return v;
}
};