题目描述
Given a collection of numbers, nums
, that might contain duplicates, return all possible unique permutations in any order.
Example 1:
Input: nums = [1,1,2] Output: [[1,1,2], [1,2,1], [2,1,1]]
Example 2:
Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Constraints:
1 <= nums.length <= 8
-10 <= nums[i] <= 10
解题思路
【C++】
1. 有条件的交换回溯
class Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<vector<int>> result;
backtracking(nums, 0, result);
return result;
}
void backtracking(vector<int>& nums, int begin, vector<vector<int>>& result) {
if (begin == nums.size()-1){
result.push_back(nums);
return;
}
for (int i = begin; i < nums.size(); i++){
if(NeedSwap(nums, begin, i)) {
swap(nums[i], nums[begin]);
backtracking(nums, begin+1, result);
swap(nums[i], nums[begin]);
}
}
}
bool NeedSwap(vector<int>& nums, int begin, int end) {
if (begin == end) {return true;}
for (int i=begin; i<end; ++i) {if(nums[i] == nums[end]) {return false;}}
return true;
}
};
2. set规避重复
class Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
set<vector<int>> temp_set;
backtracking(nums, temp_set, 0);
return vector<vector<int>>(temp_set.begin(),temp_set.end());
}
void backtracking(vector<int>& nums, set<vector<int>>& temp_set, int level){
if(level==nums.size()-1){
temp_set.insert(nums);
return;
}
for(int i=level;i<nums.size();++i){
swap(nums[i],nums[level]);
backtracking(nums,temp_set,level+1);
swap(nums[i],nums[level]);
}
}
};
【Java】
class Solution {
public List<List<Integer>> permuteUnique(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> result = new ArrayList<>();
boolean used[] = new boolean[nums.length];
backtracking(result, new ArrayList<>(), nums, used);
return result;
}
public void backtracking(List<List<Integer>> result, List<Integer> cur, int[] nums, boolean[] used) {
if (cur.size() == nums.length) result.add(new ArrayList<Integer>(cur));
for (int i=0;i<nums.length;i++) {
if (used[i]) {continue;}
if (i>0 && nums[i] == nums[i-1] && !used[i-1]) {continue;}
cur.add(nums[i]);
used[i]=true;
backtracking(result, cur, nums,used);
used[i]=false;
cur.remove(cur.size()-1);
}
}
}