916 B
916 B
TODO 0090. Subsets II medium
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]]Example 2:
Input: nums = [0]
Output: [[],[0]]Constraints:
1 <= nums.length <= 10-10 <= nums[i] <= 10
TODO Approach
Write your approach here.
TODO Python
class Solution:
def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:TODO C++
class Solution {
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
}
};