<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 generate( vector<int>& curr, vector<vector<int>>& ans, vector<int> nums) {
        if(curr.size() == nums.size()) {
            if(find(ans.begin(), ans.end(), curr) == ans.end()) {
                ans.push_back(curr);
                return;
            }
            return;
        }

        for (int i = 0; i < nums.size(); i++) {
            int k = nums[i];
            if (k == INT_MAX) continue;
            if(i > 0 && nums[i] == nums[i - 1]) continue;
            curr.push_back(k);
            nums[i] = INT_MAX;
            generate(curr, ans, nums);
            curr.pop_back();
            nums[i] = k;

        }
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<int> curr;
        vector<vector<int>> ans;
        generate( curr, ans, nums);
        return ans;
    }
};
27354