mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
33 lines
822 B
HTML
33 lines
822 B
HTML
<p>给你一个整数数组 <code>nums</code> ，其中可能包含重复元素，请你返回该数组所有可能的 <span data-keyword="subset">子集</span>（幂集）。</p>
|
||
|
||
<p>解集 <strong>不能</strong> 包含重复的子集。返回的解集中，子集可以按 <strong>任意顺序</strong> 排列。</p>
|
||
|
||
<div class="original__bRMd">
|
||
<div>
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [1,2,2]
|
||
<strong>输出：</strong>[[],[1],[1,2],[1,2,2],[2],[2,2]]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [0]
|
||
<strong>输出：</strong>[[],[0]]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= nums.length <= 10</code></li>
|
||
<li><code>-10 <= nums[i] <= 10</code></li>
|
||
</ul>
|
||
</div>
|
||
</div>
|