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

4
leetcode-cn/problem (Chinese)/最接近原点的 K 个点 [k-closest-points-to-origin].html
View File

@@ -6,7 +6,7 @@
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<p><strong class="example">示例 1：</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2021/03/03/closestplane1.jpg" style="height: 400px; width: 400px;" /></p>
@@ -20,7 +20,7 @@
我们只需要距离原点最近的 K = 1 个点，所以答案就是 [[-2,2]]。
</pre>
<p><strong>示例 2：</strong></p>
<p><strong class="example">示例 2：</strong></p>
<pre>
<strong>输入：</strong>points = [[3,3],[5,-1],[-2,4]], k = 2