题目
给定一个可包含重复数字的整数集合 nums ,按任意顺序 返回它所有不重复的全排列。
示例
输入:nums = [1,1,2]
输出:
[[1,1,2],
[1,2,1],
[2,1,1]]
输入:nums = [1,2,3]
输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/7p8L0Z
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法1:回溯
Java 实现
class Solution {
List<List<Integer>> res = new ArrayList<>();
boolean[] visited;
public List<List<Integer>> permuteUnique(int[] nums) {
int n = nums.length;
visited = new boolean[n];
LinkedList<Integer> track = new LinkedList<>();
track_back(nums, track);
return res;
}
public void track_back(int[] nums, LinkedList<Integer> track) {
if (track.size() == nums.length && !res.contains(new ArrayList<>(track))) {
res.add(new ArrayList<>(track));
return;
}
for (int i = 0; i < nums.length; i++) {
if (visited[i]) continue;
track.add(nums[i]);
visited[i] = true;
track_back(nums, track);
visited[i] = false;
track.removeLast();
}
}
}