原题:
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]
, and [2,1,1]
.
方法:
这道题,已知数组中出现了可重复数值,应对的方法是首先,对最初的数组排序,然后,在进入下一层递归前,把和当前位重复的数过滤掉。
代码:
public class Solution {
public ArrayList<ArrayList<Integer>> permuteUnique(int[] num) {
// Start typing your Java solution below
// DO NOT write main() function
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> tmp = new ArrayList<Integer>();
Arrays.sort(num);
int n = num.length;
boolean[] visited = new boolean[n];
permuteImp(res, tmp, num, visited);
return res;
}
private void permuteImp(ArrayList<ArrayList<Integer>> res, ArrayList<Integer> tmp, int[] num, boolean[] visited){
if(tmp.size() == num.length){
res.add(new ArrayList<Integer>(tmp));
return;
}
for(int i=0; i<num.length; i++){
if(!visited[i]){
tmp.add(num[i]);
visited[i] = true;
permuteImp(res, tmp, num, visited);
visited[i] = false;
tmp.remove(tmp.size()-1);
while(i+1<num.length && num[i+1]==num[i])
i++;
}
}
}
}
小结:
和Permutation I的不同之处仅仅在于第7,27,28行,三行代码。