给定一个可包含重复数字的序列 nums ,按任意顺序 返回所有不重复的全排列。
示例 1:
输入:nums = [1,1,2]
输出:
[[1,1,2],
[1,2,1],
[2,1,1]]
示例 2:
输入:nums = [1,2,3]
输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
提示:
1 <= nums.length <= 8
-10 <= nums[i] <= 10
class Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<vector<int>>res;
//sort(nums.begin(), nums.end());
int len = nums.size();
std::function<void(int pos)>helper;
helper = [&](int pos) {
if (pos == len - 1) {
res.emplace_back(nums);
return;
}
unordered_set<int>s;//去重保证,相同的值不会在pos位置出现多次
for (int i = pos; i < len; ++i) {
if (s.count(nums[i]) == 1) continue;
s.emplace(nums[i]);
swap(nums[i], nums[pos]);
helper(pos + 1);
swap(nums[i], nums[pos]);
}
};
helper(0);
return res;
}
};