<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:
   void Permute(vector<int>& nums,int i,vector<vector<int>>& v){
        if (i==nums.size()){
            v.push_back(nums);
            return;
        }

        for (int j=i; j<nums.size();j++){
            
            swap(nums[j],nums[i]);
            Permute(nums,i+1,v);
            swap(nums[j],nums[i]);
            // if (nums[j]==nums[i]){
            //     continue;
            // }
        }
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<vector<int>> v;
        
        Permute(nums,0,v);
        sort(v.begin(),v.end());
        vector<vector<int>> k;
        vector<int> s= v[0];
        k.push_back(s);
        for (int i=1; i< v.size();i++){
            if (v[i]==s){
                continue;
            }
            else{
                s=v[i];
                k.push_back(s);
            }
        }
        return k;

    }
};
35701