<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 helper(int i,int n,vector<int>& nums, vector<int> temp, vector<vector<int>>& ans){
    if(i==n){
        ans.push_back(temp);
        return;
    }
    temp.push_back(nums[i]);
    helper(i+1,n,nums,temp,ans);
    temp.pop_back();
    for(int j=i;j<n;j++){
        if(nums[j]!=nums[i] ){
             helper(j,n,nums,temp,ans);
         return;
        }
    }
    helper(n,n,nums,temp,ans);
}
    vector<vector<int> > subsetsWithDup(vector<int>& nums) {
        vector<int> temp;
        vector<vector<int>> ans;
        int n=nums.size();
                sort(nums.begin(),nums.end());
        helper(0,n,nums,temp,ans);
        sort(ans.begin(),ans.end());
        return ans;
    }
};
15503