leetcode-problemset/leetcode-cn/problem (Chinese)/幂集 [power-set-lcci].html

<p>幂集。编写一种方法，返回某集合的所有子集。集合中&nbsp;<strong>不包含重复的元素</strong>。</p>

<p>说明：解集不能包含重复的子集。</p>

<p><strong>示例：</strong></p>

<pre>
<strong> 输入：</strong>nums = [1,2,3]
<strong> 输出：</strong>
[
  [3],
&nbsp; [1],
&nbsp; [2],
&nbsp; [1,2,3],
&nbsp; [1,3],
&nbsp; [2,3],
&nbsp; [1,2],
&nbsp; []
]
</pre>