题目描述
给出一组可能包含重复项的数字,返回该组数字的所有排列
例如;
[1,1,2]的排列如下:
[1,1,2],[1,2,1], [2,1,1].
Java代码实现
import java.util.ArrayList;
import java.util.Arrays;
public class Solution {
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
public ArrayList<ArrayList<Integer>> permuteUnique(int[] num) {
if(num.length == 0 || num == null)
return res;
Arrays.sort(num);
ArrayList<Integer> list = new ArrayList<Integer>();
int[] flag = new int[num.length];
Solve(num, list, flag);
return res;
}
public void Solve(int[] num, ArrayList<Integer> list,int[] flag){
if(list.size() == num.length){
res.add(new ArrayList<>(list));
return;
}
for(int i = 0 ; i < num.length; i++){
if(flag[i] == 1){
continue;
}
if(i != 0 && num[i] == num[i-1] && flag[i-1]!= 1){
continue;
}
list.add(num[i]);
flag[i] = 1;
Solve(num, list, flag);
list.remove(list.size() - 1);
flag[i] = 0;
}
return;
}
}