coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 03:11:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
leetcode-cn/problem (Chinese)/第 k 个缺失的正整数 [kth-missing-positive-number].html
View File

@@ -6,14 +6,16 @@
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>arr = [2,3,4,7,11], k = 5
<pre>
<strong>输入：</strong>arr = [2,3,4,7,11], k = 5
<strong>输出：</strong>9
<strong>解释：</strong>缺失的正整数包括 [1,5,6,8,9,10,12,13,...] 。第 5 个缺失的正整数为 9 。
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>arr = [1,2,3,4], k = 2
<pre>
<strong>输入：</strong>arr = [1,2,3,4], k = 2
<strong>输出：</strong>6
<strong>解释：</strong>缺失的正整数包括 [5,6,7,...] 。第 2 个缺失的正整数为 6 。
</pre>
@@ -28,3 +30,9 @@
<li><code>1 &lt;= k &lt;= 1000</code></li>
<li>对于所有&nbsp;<code>1 &lt;= i &lt; j &lt;= arr.length</code>&nbsp;的 <code>i</code>&nbsp;和 <code>j</code> 满足&nbsp;<code>arr[i] &lt; arr[j]</code>&nbsp;</li>
</ul>
<p>&nbsp;</p>
<p><strong>进阶：</strong></p>
<p>你可以设计一个时间复杂度小于 O(n) 的算法解决此问题吗？</p>