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

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

@@ -10,7 +10,8 @@
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>nums = [2,4,6], k = 2
<pre>
<strong>输入：</strong>nums = [2,4,6], k = 2
<strong>输出：</strong>4
<strong>解释：</strong>数组 nums 中的美丽子集有：[2], [4], [6], [2, 6] 。
可以证明数组 [2,4,6] 中只存在 4 个美丽子集。
@@ -18,7 +19,8 @@
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>nums = [1], k = 1
<pre>
<strong>输入：</strong>nums = [1], k = 1
<strong>输出：</strong>1
<strong>解释：</strong>数组 nums 中的美丽数组有：[1] 。
可以证明数组 [1] 中只存在 1 个美丽子集。
@@ -29,6 +31,6 @@
<p><strong>提示：</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>