coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-13 01:15:14 +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

2
leetcode-cn/problem (English)/美丽子集的数目(English) [the-number-of-beautiful-subsets].html
View File

@@ -29,6 +29,6 @@ It can be proved that there is only 1 beautiful subset in the array [1].
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 &lt;= nums.length &lt;= 20</code></li>
<li><code>1 &lt;= nums.length &lt;= 18</code></li>
<li><code>1 &lt;= nums[i], k &lt;= 1000</code></li>
</ul>