<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:
    vector<vector<int>> v;
    int l=0;
    void solve(vector<int>&nums,vector<int> k,int i){
        if(i==nums.size()) return;
        // l++;
        for(;i<nums.size();i++){
            k.push_back(nums[i]);
            v.push_back(k);
            solve(nums,k,i+1);
            k.pop_back();
        }
    }
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<int> k;
        solve(nums,k,0);
        // return v;
        set<vector<int>>s;
        for(auto i:v){
            sort(i.begin(),i.end());
            s.insert(i);
        }
        vector<vector<int>>ans;
        ans.push_back({});
        for(auto i:s) ans.push_back(i);
        return ans;
    }
};
11145