Package g0001_0100.s0090_subsets_ii

Class Solution

java.lang.Object
g0001_0100.s0090_subsets_ii.Solution
public class Solution extends java.lang.Object
90 - 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

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    java.util.List<java.util.List<java.lang.Integer>>
    subsetsWithDup(int[] nums)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • subsetsWithDup

      public java.util.List<java.util.List<java.lang.Integer>> subsetsWithDup(int[] nums)