Fair Unique PermutationsMy Submissions
Fair Unique PermutationsMy Submissions
<span style="color:rgba(0, 0, 0, 0);">class Solution {
/**
* @param nums: A list of integers.
* @return: A list of unique permutations.
*/
ArrayList<ArrayList<Integer>> rst = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> cur = new ArrayList<Integer>();
public ArrayList<ArrayList<Integer>> permuteUnique(ArrayList<Integer> nums) {
// write your code here
if (nums == null || nums.size() == 0) {
return rst;
}
int[] num = new int[nums.size()];
for (int i = 0; i < nums.size(); i++) {
num[i] = nums.get(i);
}
Arrays.sort(num);
permute(num, 0);
return rst;
}
void permute(int[] num, int level) {
if (level == num.length) {
rst.add(new ArrayList<Integer>(cur));
return;
}
</span><span style="color:#ff0000;">for (int i = level; i < num.length; i++) {
if (i > 0 && i > level && num[i] == num[i - 1] ||
i > level && num[i] == num[level]) {
continue;</span><span style="color:rgba(0, 0, 0, 0);">
}
swap(num, level, i);
cur.add(num[level]);
permute(num, level + 1);
cur.remove(cur.size() - 1);
swap(num, level, i);
}
}
void swap(int[] num, int i, int j) {
int temp = num[i];
num[i] = num[j];
num[j] = temp;
}
}
</span>
假设input是 [0,0,0,1,9]
i > level && num[i] == num[level] ,如果当前level指向第一个0,这句保证,
不会让0和后面的0交换
i > 0 && i > level && num[i] == num[i - 1], 如果当前level指向第二个0,
那么它所引导的所有permutation其实在level指向
第一个0的时候都被遍历完了,所以skip这俩情况,
目的都是同一level不要重复取相同的数来做遍历,
只要遍历一次就好。
<span style="color:rgba(0, 0, 0, 0);">class Solution {
/**
* @param nums: A list of integers.
* @return: A list of unique permutations.
*/
ArrayList<ArrayList<Integer>> rst = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> cur = new ArrayList<Integer>();
public ArrayList<ArrayList<Integer>> permuteUnique(ArrayList<Integer> nums) {
// write your code here
if (nums == null || nums.size() == 0) {
return rst;
}
int[] num = new int[nums.size()];
for (int i = 0; i < nums.size(); i++) {
num[i] = nums.get(i);
}
Arrays.sort(num);
permute(num, 0);
return rst;
}
void permute(int[] num, int level) {
if (level == num.length) {
rst.add(new ArrayList<Integer>(cur));
return;
}
</span><span style="color:#ff0000;">for (int i = level; i < num.length; i++) {
if (i > 0 && i > level && num[i] == num[i - 1] ||
i > level && num[i] == num[level]) {
continue;</span><span style="color:rgba(0, 0, 0, 0);">
}
swap(num, level, i);
cur.add(num[level]);
permute(num, level + 1);
cur.remove(cur.size() - 1);
swap(num, level, i);
}
}
void swap(int[] num, int i, int j) {
int temp = num[i];
num[i] = num[j];
num[j] = temp;
}
}
</span>
最开始我我是这样写的:
for (int i = level; i < num.length; i++) {
if (i > 0 && num[i] == num[i - 1]) {
continue;
}
这样当level指向第一个0的时候,它还是会和后面的0交换,会重复打印。