<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 dfs(vector<vector<int>>& ans, vector<int>& nums, vector<int> tmp, int now){
        
        if(now==nums.size())return;
        int go[2] = {0, 1};
        for(auto &i: go){
            if(i){
                tmp.push_back(nums[now]);
                sort(tmp.begin(), tmp.end());
                if(find(ans.begin(), ans.end(), tmp)==ans.end())ans.push_back(tmp);
            }
            dfs(ans, nums, tmp, now+1);
        }
    }
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        int n = nums.size();
        vector<vector<int>> ans;
        vector<int>tmp;
        ans.push_back({});
        dfs(ans, nums, tmp, 0);
        return ans; 
    }
};
10834