<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>

/*
 * @lc app=leetcode id=90 lang=cpp
 *
 * [90] Subsets II
 */

// @lc code=start
class Solution
{
public:
    vector<vector<int>> ans;
    void findsum(int i, vector<int> v, vector<int> &nums)
    {
        if(i>=nums.size())
        return;
        vector<int> temp = v;
        temp.push_back(nums[i]);
        ans.push_back(temp);
        findsum(i + 1, temp, nums);
        for (int j = i + 1; j < nums.size(); j++)
        {
            vector<int > t = v;
            if (nums[j] != nums[j - 1])
            {
                t.push_back(nums[j]);
                ans.push_back(t);
                findsum(j + 1, t, nums);
            }
        }
    }
    vector<vector<int>> subsetsWithDup(vector<int> &nums)
    {
        sort(nums.begin(), nums.end());
        ans.push_back({});
        findsum(0, {}, nums);
        return ans;
    }
};
// @lc code=end

13739