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]] Explanation: Even though 2 appears twice, [2] and [1, 2] are each counted once.
Input: nums = [0] Output: [[], [0]] Explanation: A single element has two subsets: the empty set and itself.
1 <= nums.length <= 10-10 <= nums[i] <= 10nums = [1, 2, 2]