<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 recur(vector<int>& nums,vector<int> temp,int index, vector<vector<int>>& ans){
        if(index == nums.size()){
            ans.push_back(temp);
            return;
        }
        //not pick
        recur(nums,temp,index+1,ans);
        //pick
        temp.push_back(nums[index]);
        recur(nums,temp,index+1,ans);

    }

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>> ans;
        vector<int> temp;
        sort(nums.begin(),nums.end());
        // recur(nums,temp,index,ans)
        recur(nums,temp,0,ans);
        set<vector<int>> uniqueSubsets(ans.begin(), ans.end());
        ans.assign(uniqueSubsets.begin(), uniqueSubsets.end());

        return ans;
    }
};
15918