<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 {
   void solve(vector<int>&nums, int index, vector<int>output, vector<vector<int>> &ans){
      if(index>= nums.size()){
        if(find(ans.begin(),ans.end(),output)==ans.end())
         ans.push_back(output);
        return;
      }
      /*if(nums[index]== nums[index+1])
       index++;*/
      solve(nums,index+1,output,ans);
      output.push_back(nums[index]);
      solve(nums,index+1,output,ans);
   }

public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<int>output;
        vector<vector<int>> ans;
        sort(nums.begin(), nums.end());
        solve(nums,0,output,ans);
        return ans;
    }
};
15295