LeetCode第47题思悟—— 全排列 II（permutations-ii）-CSDN博客

本文链接：https://blog.csdn.net/slx3320612540/article/details/100581653

LeetCode第47题思悟—— 全排列 II（permutations-ii）

知识点预告

深度优先搜索；
数据去重；

题目要求

给定一个可包含重复数字的序列，返回所有不重复的全排列。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/permutations-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

示例

输入: [1,1,2]
输出:
[
[1,1,2],
[1,2,1],
[2,1,1]
]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/permutations-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

我的思路

public List<List<Integer>> permute(int[] nums) {
	Arrays.sort(nums);
	List<List<Integer>> results=new ArrayList<>();
	if(nums.length==0){
		return results;
	}
	boolean[] books=new boolean[nums.length];
	List<Integer> start;
	List<List<Integer>> startList=new ArrayList<>();
	int lastNum;
	for(int i=0;i<nums.length;i++){
		start = new ArrayList<>(nums.length);
		start.add(nums[i]);
		startList.add(start);
		books[i] = true;
		results.addAll(stepForward(nums, books, startList, nums.length - 1));
		books[i] = false;
		startList.remove(start);
		lastNum=nums[i];
		i++;
		while(i<nums.length&&nums[i]==lastNum){
			i++;
		}
		i--;
	}
	return results;
}
public List<List<Integer>> stepForward(int[]nums,boolean[] books,
											  List<List<Integer>> products,int needNum){
	if(needNum==0){
		return products;
	}
	int restNum=needNum;
	List<List<Integer>>nextToFill=products;
	List<List<Integer>>currentToFill;
	List<List<Integer>>result=new ArrayList<>();
	int lastNum=nums[0];
	for(int i=0;i<books.length;i++){
		if (!books[i]) {
			currentToFill = nextToFill;
			restNum--;
			books[i] = true;
			if (restNum > 0) {
				nextToFill = new ArrayList<>(currentToFill.size());
				for (List<Integer> list : currentToFill) {
					nextToFill.add(new ArrayList<>(list));
					list.add(nums[i]);
				}
			} else {
				for (List<Integer> list : currentToFill) {
					list.add(nums[i]);
				}
			}
			result.addAll(stepForward(nums, books, currentToFill, needNum - 1));
			books[i] = false;
			lastNum=nums[i];
			i++;
			while(i<books.length&&nums[i]==lastNum){
				i++;
				restNum--;
			}
			i--;
		}
	}
	return result;
}

优秀解法

public List<List<Integer>> permuteUnique(int[] nums) {
	List<List<Integer>> permutes = new ArrayList<>();
	List<Integer> permuteList = new ArrayList<>();
	Arrays.sort(nums);
	boolean[] hasVisited = new boolean[nums.length];
	dfs(permuteList, permutes, hasVisited, nums);
	return permutes;
}
private void dfs(List<Integer> permuteList, List<List<Integer>> permutes, boolean[] visited, final int[] nums) {
	if(permuteList.size() == nums.length) {
		permutes.add(new ArrayList<>(permuteList));
		return;
	}
	for (int i = 0; i < visited.length; i++) {
		if (i != 0 && nums[i] == nums[i - 1] && !visited[i - 1]) {
			continue;
		}
		if (visited[i]) {
			continue;
		}
		visited[i] = true;
		permuteList.add(nums[i]);
		dfs(permuteList, permutes, visited, nums);
		permuteList.remove(permuteList.size() - 1);
		visited[i] = false;
	}
}