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

30
leetcode-cn/problem (English)/最小K个数(English) [smallest-k-lcci].html
View File

@@ -1,15 +1,15 @@
<p>Design an algorithm to find the smallest K numbers in an array.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> arr = [1,3,5,7,2,4,6,8], k = 4
<strong>Output: </strong> [1,2,3,4]
</pre>
<p><strong>Note: </strong></p>
<ul>
<li><code>0 &lt;= len(arr) &lt;= 100000</code></li>
<li><code>0 &lt;= k &lt;= min(100000, len(arr))</code></li>
</ul>
<p>Design an algorithm to find the smallest K numbers in an array.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> arr = [1,3,5,7,2,4,6,8], k = 4
<strong>Output: </strong> [1,2,3,4]
</pre>