一、题目描述
给定一个可包含重复数字的序列 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]]
二、题解
class Solution {
public:
vector<vector<int>> permuteUnique(vector<int> &nums) {
vector<bool> records(nums.size(), false); // records[i]为true表示nums[i]已经被添加到序列中
sort(nums.begin(), nums.end());
backtracking(nums, records);
return result;
}
private:
vector<vector<int>> result;
vector<int> each_case;
void backtracking(vector<int> &nums, vector<bool> &records) {
if (each_case.size() == nums.size()) {
result.emplace_back(each_case);
return;
}
for (int i = 0; i < nums.size(); i++) {
if (!records.at(i)) {
if (i > 0 && nums.at(i - 1) == nums.at(i) && !records.at(i - 1)) { // 同样的值已经在同一层被用过了,需要进行剪枝
continue;
}
each_case.emplace_back(nums.at(i));
records.at(i) = true;
backtracking(nums, records);
each_case.pop_back();
records.at(i) = false;
}
}
}
};