#90

Subsets II

specialist · 695 · lc medium +30 · verified · 60.9% accepted · 10,869 likes · top 60%

Description

Integer array nums may contain duplicates. Return all possible subsets (the power set) with no duplicate subsets included. Results may be 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]]

Code

1

2

3

class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:

class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]: