Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
- Elements in a subset must be in non-descending order.
- The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2]
, a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], [] ]
Subsets的改进版,就是加了个判断。
package leetcode;
import java.util.ArrayList;
import java.util.Arrays;
public class SubsetsII {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
}
public ArrayList<ArrayList<Integer>> subsetsWithDup(int[] num) {
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> r = new ArrayList<Integer>();
result.add(r);
if (num == null || num.length == 0) {
return result;
}
Arrays.sort(num);
int[] pos = new int[num.length + 1];
for (int len = 1; len <= num.length; len++) {
Arrays.fill(pos, -1);
int index = 1;
while (index >= 1) {
int pre = pos[index];
if (pos[index] == -1) {
pos[index] = pos[index - 1] + 1;
} else {
pos[index]++;
}
if (pre != -1) {
while (pos[index] < num.length
&& num[pos[index]] == num[pre]) {
pos[index]++;
}
}
if (pos[index] < num.length) {
if (index == len) {
ArrayList<Integer> rr = new ArrayList<Integer>();
for (int i = 1; i <= len; i++) {
rr.add(num[pos[i]]);
}
result.add(rr);
} else {
pos[index + 1] = -1;
index++;
}
} else {
index--;
}
}
}
return result;
}
}