coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-18 02:02:34 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,11 +1,12 @@
<p>幂集。编写一种方法，返回某集合的所有子集。集合中<strong>不包含重复的元素</strong>。</p>
<p>幂集。编写一种方法，返回某集合的所有子集。集合中&nbsp;<strong>不包含重复的元素</strong>。</p>
<p>说明：解集不能包含重复的子集。</p>
<p><strong>示例:</strong></p>
<p><strong>示例：</strong></p>
<pre><strong> 输入</strong>： nums = [1,2,3]
<strong> 输出</strong>：
<pre>
<strong> 输入：</strong>nums = [1,2,3]
<strong> 输出：</strong>
[
[3],
&nbsp; [1],