class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void doBack(int size, vector<int>& nums, vector<bool>& used, int start){
if(path.size() == size){
result.push_back(path);
return;
}
for(int i = 0; i < size; i++){
if(used[i] == true || i > 0 && nums[i] == nums[i - 1] && used[i -1] == false)
continue;
path.push_back(nums[i]);
used[i] = true;
doBack(size, nums, used, i + 1);
path.pop_back();
used[i] = false;
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), false);
doBack(nums.size(), nums, used, 0);
return result;
}
};