Given a collection of integers that might contain duplicates, nums, return all possible subsets.
Note: The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,2]
, a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], [] ]
public class Solution {
public List<List<Integer>> subsetsWithDup(int[] nums) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
Arrays.sort(nums);
helper(res, new ArrayList<Integer>(), nums, 0);
return res;
}
private void helper(List<List<Integer>> res, List<Integer> subList, int[] nums, int start) {
if (start <= nums.length) {
res.add(subList);
}
int i = start;
while (i < nums.length) {
subList.add(nums[i]);
helper(res, new ArrayList<Integer>(subList), nums, i + 1);
subList.remove(subList.size() - 1);
i++;
while (i < nums.length && nums[i] == nums[i - 1]) {
i++;
}
}
}
}