leetcode 47. Permutations II

class Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums)
{
sort(nums.begin(), nums.end());
process(nums, 0);
return res;
}
private:
vector<vector<int>>res;
void process(vector<int> temp, int left)
{
if (left == temp.size() - 1)
{
res.push_back(temp);
return;
}
for (int i = left; i < temp.size(); i++)
{
if (i != left && temp[i] == temp[left])
{
continue;
}
swap(temp[i], temp[left]);
process(temp, left + 1);
}
}
};