<p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span><em> (the power set)</em>.</p>

<p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1,2,2]
<strong>Output:</strong> [[],[1],[1,2],[1,2,2],[2],[2,2]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [0]
<strong>Output:</strong> [[],[0]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
</ul>

class Solution {
public:
    void subs(vector<int>& nums,int n,int i,vector<int>&curr,vector<vector<int>>& ans){
        if(i==n){
            ans.push_back(curr);
            return;
        }
        subs(nums,n,i+1,curr,ans);
        curr.push_back(nums[i]);
        subs(nums,n,i+1,curr,ans);
        curr.pop_back();
    }
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>> ans;vector<int> curr;
        subs(nums,nums.size(),0,curr,ans);
        map<vector<int>,int>mpp;
        for(int i=0;i<ans.size();i++){
            sort(ans[i].begin(),ans[i].end());
        }
        for(int i=0;i<ans.size();i++){
            if(mpp.find(ans[i])==mpp.end())mpp[ans[i]]++;
        }
        vector<vector<int>> fans;
        for(auto i:mpp)fans.push_back(i.first);
        return fans;
    }
};
13116