<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>> allsubsets;
void generate(vector<int> &subsets,int i,vector<int> &nums,bool pre){
    if(i==nums.size()){
        allsubsets.push_back(subsets);
    }
    else{
        generate(subsets,i+1,nums,false);
        if(i>0 && nums[i]==nums[i-1]&& (!pre))
        return;
        subsets.push_back(nums[i]);
        generate(subsets,i+1,nums,true);
        subsets.pop_back();
    }
    
}
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<int> empty;
        generate(empty,0,nums,false);
        return allsubsets;
    }
};
12079