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]
.
利用了 Next Permutation 的函数方法。
refer: http://fisherlei.blogspot.com/2012/12/leetcode-next-permutation.html
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
/*
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 Permutation {
private boolean nextPermutation(ArrayList<Integer> nums) {
int partitionNumber = -1, changeNumber = -1;
for(int i = nums.size() - 1; i > 0; i-- ) {
if(nums.get(i) > nums.get(i-1)) {
partitionNumber = i - 1;
break;
}
}
if(partitionNumber == -1) return false;
for(int j = nums.size() - 1; j > partitionNumber; j--) {
if(nums.get(j) > nums.get(partitionNumber)) {
changeNumber = j;
break;
}
}
Collections.swap(nums, partitionNumber, changeNumber);
for(int left = partitionNumber + 1, right = nums.size() - 1; left < right; left++, right--) {
Collections.swap(nums, left, right);
}
return true;
}
public ArrayList<ArrayList<Integer> > permuteUnique(int[] num) {
//
ArrayList<ArrayList<Integer> > results = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> nums = new ArrayList<Integer>();
for(int i = 0; i < num.length; i++) {
nums.add(num[i]);
}
Collections.sort(nums);
results.add(new ArrayList<Integer>(nums));
while(nextPermutation(nums)) {
results.add(new ArrayList<Integer>(nums));
}
return results;
}
/**
* @param args
*/
public static void main(String[] args) {
//
int[] num = { 1, 1, 2 };
Permutation p = new Permutation();
ArrayList<ArrayList<Integer> > r = p.permuteUnique(num);
for(ArrayList<Integer> a : r) {
System.out.println(a);
}
}
}