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

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,20 +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>
<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>:
[