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]]
Explanation: The subsets are generated while skipping duplicates. For instance, [2] appears only once even though 2 appears twice in the input.
Example 2:
Input: nums = [0]
Output: [[],[0]]
Explanation: The only subsets are the empty set and [0].
1 <= nums.length <= 10-10 <= nums[i] <= 10