Published Jun 13, 2022
[
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.
Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
Input: nums = [0]
Output: [[],[0]]
1 <= nums.length <= 10-10 <= nums[i] <= 10nums first, and do some consecutive check with while loopfunction subsetsWithDup(nums: number[]): number[][] {
const res: number[][] = []
const LEN: number =nums.length
nums.sort((a, b) => a - b)
const exec = (i: number, subset: number[]) => {
if(i === LEN) {
res.push([...subset])
return
}
subset.push(nums[i])
exec(i + 1, subset)
subset.pop()
while(i + 1 < LEN && nums[i] === nums[i + 1]) i++;
exec(i + 1, subset)
}
exec(0, [])
return res;
};