<p>Given a collection of numbers, <code>nums</code>,&nbsp;that might contain duplicates, return <em>all possible unique permutations <strong>in any order</strong>.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,2]
<strong>Output:</strong>
[[1,1,2],
 [1,2,1],
 [2,1,1]]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3]
<strong>Output:</strong> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 8</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
</ul>

class Solution {
public:
    vector<vector<int>> res;
    void helper(vector<int>& nums, vector<int> temp) {
        if (nums.size()==0){
            res.push_back(temp);
            return;
        }
        for(int j=0;j<nums.size();j++){
            if(j==0 || nums[j]!=nums[j-1]){
            int tempVar=nums[j];
            vector<int> temp2=temp;
            temp2.push_back(tempVar);
            nums.erase(nums.begin()+j);
            helper(nums, temp2);
            nums.insert(nums.begin()+j, tempVar);
            }else{
                continue;
            }
        }
        return;
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<int> temp;
        sort(nums.begin(), nums.end());
        helper(nums, temp);
        return res;
    }
};
15296