LeetCode 973. K Closest Points to Origin

原题链接在这里：https://leetcode.com/problems/k-closest-points-to-origin/

题目：

We have a list of points on the plane. Find the K closest points to the origin (0, 0).

(Here, the distance between two points on a plane is the Euclidean distance.)

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) < sqrt(10), (-2, 2) is closer to the origin.
We only want the closest K = 1 points from the origin, so the answer is just [[-2,2]].

Example 2:

Input: points = [[3,3],[5,-1],[-2,4]], K = 2
Output: [[3,3],[-2,4]]
(The answer [[-2,4],[3,3]] would also be accepted.)

Note:

1 <= K <= points.length <= 10000
-10000 < points[i][0] < 10000
-10000 < points[i][1] < 10000

题解：

用maxHeap来维护K shortest distence.

Time Complexity: O(nlogK). n = points.length.

Space: O(n).

AC Java:

 1 class Solution {
 2     public int[][] kClosest(int[][] points, int K) {
 3         if(points == null || points.length == 0 || K < 1){
 4             return points;
 5         }
 6
 7         PriorityQueue<int []> pq = new PriorityQueue<int []>((a, b) -> getDistanceSquare(b)-getDistanceSquare(a));
 8         for(int [] point : points){
 9             pq.add(point);
10             if(pq.size() > K){
11                 pq.poll();
12             }
13         }
14
15         int [][] res = new int[K][2];
16         for(int i = 0; i<K; i++){
17             res[i] = pq.poll();
18         }
19
20         return res;
21     }
22
23     private int getDistanceSquare(int [] point){
24         return point[0]*point[0] + point[1]*point[1];
25     }
26 }

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/10556223.html

LeetCode 973. K Closest Points to Origin相关推荐

Leetcode PHP题解--D29 973. K Closest Points to Origin
973. K Closest Points to Origin 题目链接 973. K Closest Points to Origin 题目分析给一个坐标数组points,从中返回K个离0,0最近 ...
LeetCode 973. K Closest Points to Origin--TopK 问题--最小堆--C++,Python解法
题目地址:K Closest Points to Origin - LeetCode We have a list of points on the plane. Find the K closest ...
LeetCode Daily challenge - K Closest Points to Origin
文章目录题目大意思路代码总结题目大意找前K小元素,只不过元素是二维的坐标思路很容易想到排序后取前K个,虽然可以但是速度不够快.实际上类似于找第K大(小),可以用划分的方法找,每次随机划 ...
LeetCode 973. 最接近原点的 K 个点（排序/优先队列/快排）
文章目录 1. 题目 2. 解题 2.1 排序 2.2 优先队列 2.3 快排思路 1. 题目我们有一个由平面上的点组成的列表 points.需要从中找出 K 个距离原点 (0, 0) 最近的点. ...
LeetCode:658. Find K Closest Elements程序分析
好久没有练习算法了,以此纪研究生以来第一次练习算法题. 原题链接:https://leetcode.com/problems/find-k-closest-elements/description/ ...
[Leetcode]658. Find K Closest Elements
# [[Leetcode]658. Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/) - ...
迭代最近点算法 Iterative Closest Points
研究生课程系列文章参见索引<在信科的那些课> 基本原理假定已给两个数据集P.Q, ,给出两个点集的空间变换f使他们能进行空间匹配.这里的问题是,f为一未知函数,而且两点集中的点数不一定相 ...
LeetCode 787. K 站中转内最便宜的航班（图/Bellman Ford算法）
文章目录贝尔曼-福特算法(Bellman-Ford) 简介算法思想算法执行过程应用题目描述分析代码 LeetCode 787. K 站中转内最便宜的航班题目描述 Bellman For ...
LeetCode——787. K 站中转内最便宜的航班(Cheapest Flights Within K Stops)[中等]——分析及代码（Java）
LeetCode--787. K 站中转内最便宜的航班[Cheapest Flights Within K Stops][中等]--分析及代码[Java] 一.题目二.分析及代码 1. 动态规划 ( ...
LeetCode 787.K站中转内最便宜的航班
LeetCode 787.K站中转内最便宜的航班有 n 个城市通过 m 个航班连接.每个航班都从城市 u 开始,以价格 w 抵达 v. 现在给定所有的城市和航班,以及出发城市 src 和目的地 ds ...

LeetCode 973. K Closest Points to Origin

LeetCode 973. K Closest Points to Origin相关推荐

最新文章

热门文章