Permutation II （Contains Duplication）

最新推荐文章于 2022-03-18 12:09:01 发布

Daisy_HJL

最新推荐文章于 2022-03-18 12:09:01 发布

阅读量265

点赞数

分类专栏： Algorithm 文章标签： Permutation II conta backtracking

本文链接：https://blog.csdn.net/qq_28618765/article/details/72859019

版权

Algorithm 专栏收录该内容

74 篇文章 1 订阅

订阅专栏

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following unique permutations:

[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]

代码如下：

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class PermutationIIContainsDuplication {
	
	public List<ArrayList<Integer>> permutationII(int[] nums){
		
		List<ArrayList<Integer>> list = new ArrayList<>();
		Arrays.sort(nums);
		backtrack(list,new ArrayList<>(),nums,new boolean[nums.length]);
		return list;
		
	}

	private void backtrack(List<ArrayList<Integer>> list, ArrayList<Integer> arrayList, int[] nums, boolean[] used) {

		if(arrayList.size() == nums.length)
			list.add(new ArrayList<>(arrayList));
		else{
			for(int i=0;i<nums.length;i++){
				if(used[i] || i>0&&nums[i]==nums[i-1]&&!used[i])	//避免出现重复结果
					continue;
				used[i]=true;
				arrayList.add(nums[i]);
				backtrack(list,arrayList,nums,used);
				used[i]=false;
				arrayList.remove(arrayList.size()-1);
			}
		}
		
		
	}
	
}