Package g0001_0100.s0090_subsets_ii

Class Solution

java.lang.Object

g0001_0100.s0090_subsets_ii.Solution

public class Solution
extends Object

90 - Subsets II.<p>Medium</p> <p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible subsets (the power set)</em>.</p> <p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,2]</p> <p><strong>Output:</strong> [ [],[1],[1,2],[1,2,2],[2],[2,2]]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [0]</p> <p><strong>Output:</strong> [ [],[0]]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10</code></li> <li><code>-10 <= nums[i] <= 10</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<List<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 List<List<Integer>> subsetsWithDup(int[] nums)