SubSet2
-
[Algo Rhythm🕺💃] LeetCode 90. SubsetsIIAlgo Rhythm🕺💃/LeetCode 2020. 8. 22. 23:24
📚 Problem description 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], [] ] 🎯 Solution class Solution { List ans = new ArrayList(); public List subsetsWithDup(int[] nums) { Arrays.sort(nums); backtrack(nums, ..