forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
90-Subsets-II.java
29 lines (26 loc) · 889 Bytes
/
90-Subsets-II.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
//Similar to subsets 1. Here, we'll just take care of the duplicates.
//This video was helpful https://www.youtube.com/watch?v=mcg4qKbAmmY&t=316s&ab_channel=Fraz
class Solution {
public List<List<Integer>> subsetsWithDup(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> ans = new ArrayList<>();
List<Integer> list = new ArrayList<>();
subSet(nums, 0, ans, list);
return ans;
}
public void subSet(
int[] nums,
int idx,
List<List<Integer>> ans,
List<Integer> list
) {
ans.add(new ArrayList<>(list));
for (int i = idx; i < nums.length; i++) {
//skip the duplicate elements
if (i > idx && nums[i] == nums[i - 1]) continue;
list.add(nums[i]);
subSet(nums, i + 1, ans, list);
list.remove(list.size() - 1);
}
}
}