题目描述:
给定一个可能包含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
输入:
[1,2,2]
输出:
[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]
题意:
题目描述
题解:
简单dfs
排个序后直接爆搜,用set去重就好了
代码:
class Solution {
List<List<Integer>> ans2 = new ArrayList<>();
HashSet<List<Integer>> set = new HashSet<>();
public List<List<Integer>> subsetsWithDup(int[] nums) {
int len = nums.length;
Arrays.sort(nums);
for(int i = 0; i <= len; i ++){
List<Integer> list = new ArrayList<>();
subsetsWithDup_dfs(-1,i,nums,list);
}
return ans2;
}
public void subsetsWithDup_dfs(int st,int num,int [] nums,List<Integer> list){
if(num == 0){
if(!set.contains(list)){
ans2.add(new ArrayList<>(list));
set.add(new ArrayList<>(list));
}
return ;
}
for(int i = st + 1; i < nums.length; i ++){
list.add(nums[i]);
subsetsWithDup_dfs(i,num -1 ,nums,list);
list.remove(list.size() - 1);
}
}
}