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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
leetcode-cn/problem (English)/幂集(English) [power-set-lcci].html Normal file
View File

@@ -0,0 +1,20 @@
<p>Write a method to return all subsets of a set. The elements in a set are&nbsp;pairwise distinct.</p>
<p>Note: The result set should not contain duplicated subsets.</p>
<p><strong>Example:</strong></p>
<pre>
<strong> Input</strong>: nums = [1,2,3]
<strong> Output</strong>:
[
[3],
&nbsp; [1],
&nbsp; [2],
&nbsp; [1,2,3],
&nbsp; [1,3],
&nbsp; [2,3],
&nbsp; [1,2],
&nbsp; []
]
</pre>