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

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (Chinese)/找到 K 个最接近的元素 [find-k-closest-elements].html
View File

@@ -19,8 +19,8 @@
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入：</strong>arr = [1,2,3,4,5], k = 4, x = -1
<strong>输出：</strong>[1,2,3,4]
<strong>输入：</strong>arr = [1,1,2,3,4,5], k = 4, x = -1
<strong>输出：</strong>[1,1,2,3]
</pre>
<p>&nbsp;</p>