Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:
Input: [1,2,2] Output: [ [2], [1], [1,2,2], [2,2], [1,2], [] ]
列出所有可能 并去除重复
class Solution {
public List<List<Integer>> subsetsWithDup(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
Arrays.sort(nums);
for (int i = 0; i <= nums.length; i++) {
setValue(nums, i, 0, new ArrayList<>(), res);
}
return res;
}
public void setValue(int[] nums,int num,int index,List<Integer> tmp,List<List<Integer>> res) {
if(num == 0) {
res.add(new ArrayList<>(tmp));
return ;
}
for(int i=index;i<nums.length;i++) {
//去重方法
if(i!=index && nums[i-1]==nums[i]) {
continue;
}
tmp.add(nums[i]);
setValue(nums,num-1,i+1,tmp,res);
tmp.remove(tmp.size()-1);
}
}
}