mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
20 lines
784 B
HTML
20 lines
784 B
HTML
<p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span><em> (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> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> nums = [1,2,2]
|
|
<strong>Output:</strong> [[],[1],[1,2],[1,2,2],[2],[2,2]]
|
|
</pre><p><strong class="example">Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> nums = [0]
|
|
<strong>Output:</strong> [[],[0]]
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 10</code></li>
|
|
<li><code>-10 <= nums[i] <= 10</code></li>
|
|
</ul>
|