LeetCode-in-Java
90. Subsets II
Medium
Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Example 1:
Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
Example 2:
Input: nums = [0]
Output: [[],[0]]
Constraints:
1 <= nums.length <= 10-10 <= nums[i] <= 10
Solution
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
@SuppressWarnings("java:S5413")
public class Solution {
List<List<Integer>> allComb = new ArrayList<>();
List<Integer> comb = new ArrayList<>();
int[] nums;
public List<List<Integer>> subsetsWithDup(int[] nums) {
Arrays.sort(nums);
this.nums = nums;
dfs(0);
allComb.add(new ArrayList<>());
return allComb;
}
private void dfs(int start) {
if (start > nums.length) {
return;
}
for (int i = start; i < nums.length; i++) {
if (i > start && nums[i] == nums[i - 1]) {
continue;
}
comb.add(nums[i]);
allComb.add(new ArrayList<>(comb));
dfs(i + 1);
comb.remove(comb.size() - 1);
}
}
}