LeetCode 973. K Closest Points to Origin - 优先级队列（Priority Queue）系列题2

最新推荐文章于 2025-04-12 23:21:16 发布

CP Coding

最新推荐文章于 2025-04-12 23:21:16 发布

阅读量515

点赞数 1

分类专栏： Leetcode刷题笔记优先级队列文章标签： leetcode python 数组结构算法优先级队列

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/122772640

版权

该博客介绍了如何利用优先级队列（Python的heapq库）解决LeetCode上的973题，即在X-Y平面上找出离原点最近的K个点。通过比较点与原点的欧几里得距离的平方，使用最大堆来确保最近的点始终在队列中。博主提供了两种解法，包括自定义类并实现最大堆，以及直接利用最小堆通过将距离取负来找到最近的点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0).

The distance between two points on the X-Y plane is the Euclidean distance (i.e., √(x1 - x2)2 + (y1 - y2)2).

You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in).

Example 1:

Input: points = [[1,3],[-2,2]], k = 1
Output: [[-2,2]]
Explanation:
The distance between (1, 3) and the origin is sqrt(10).
The distance between (-2, 2) and the origin is sqrt(8).
Since sqrt(8