<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 subset(vector<int> temp,vector<int> nums,vector<vector<int>> &powerSet,int index){
        if(index > nums.size()){
            return;
        }
        powerSet.push_back(temp);
        
        for(int i=index; i<nums.size(); i++){
            if(i>index && nums[i] == nums[i-1]) continue;
            
            temp.push_back(nums[i]);
            subset(temp,nums,powerSet,i + 1);
            temp.pop_back();
        }
    }


    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>> powerSet;
        vector<int> temp;
        sort(nums.begin(),nums.end());
        subset(temp,nums,powerSet,0);
        return powerSet;
    }
};
9693