Skip to content

Files

Latest commit

author
Shuo
Jul 10, 2021
62f1dec · Jul 10, 2021

History

History

subsets-ii

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Jul 10, 2021
Nov 12, 2019
Nov 12, 2019

< Previous                  Next >

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

Related Topics

[Bit Manipulation] [Array] [Backtracking]

Similar Questions

  1. Subsets (Medium)