我们有一个由平面上的点组成的列表 points。需要从中找出 K 个距离原点 (0, 0) 最近的点。
(这里,平面上两点之间的距离是欧几里德距离。)
你可以按任何顺序返回答案。除了点坐标的顺序之外,答案确保是唯一的。
示例 1:
输入:points = [[1,3],[-2,2]], K = 1
输出:[[-2,2]]
解释:
(1, 3) 和原点之间的距离为 sqrt(10),
(-2, 2) 和原点之间的距离为 sqrt(8),
由于 sqrt(8) < sqrt(10),(-2, 2) 离原点更近。
我们只需要距离原点最近的 K = 1 个点,所以答案就是 [[-2,2]]。
示例 2:
输入:points = [[3,3],[5,-1],[-2,4]], K = 2
输出:[[3,3],[-2,4]]
(答案 [[-2,4],[3,3]] 也会被接受。)
提示:
1 <= K <= points.length <= 10000
-10000 < points[i][0] < 10000
-10000 < points[i][1] < 10000
package com.leetcode.shuati;
import java.util.*;
/**
* @Author: renyitian
* @Date: 4:00 下午 2020/11/9
* @Description:
* @Version v1.0
*/
public class Yyandian {
public static int[][] aa = {{3, 3}, {5, -1}, {-2, 4}};
public static int[][] kClosest(int[][] points, int K) {
int[][] result = new int[K][2];
List<String> list = new ArrayList<>();
for (int i = 0; i < points.length; i++) {
list.add(points[i][0] + "," + points[i][1]);
}
Collections.sort(list);
Collections.sort(list, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
double o1Val = (Math.pow(Integer.valueOf(o1.split(",")[0]), 2) + Math.pow(Integer.valueOf(o1.split(",")[1]), 2));
double o2Val = (Math.pow(Integer.valueOf(o2.split(",")[0]), 2) + Math.pow(Integer.valueOf(o2.split(",")[1]), 2));
if (o1Val > o2Val) {
return 1;
} else if (o1Val == o2Val) {
return 0;
} else {
return -1;
}
}
});
for (int i = 0; i < K; i++) {
String str = list.get(i);
result[i][0] = Integer.valueOf(str.split(",")[0]);
result[i][1] = Integer.valueOf(str.split(",")[1]);
}
return result;
}
public static void main(String[] args) {
int[][] result = kClosest(aa, 2);
for (int i = 0; i < result.length; i++) {
System.out.println();
for (int j = 0; j < result[i].length; j++) {
System.out.print(result[i][j]);
}
}
}
}
大佬做法:
public int[][] kClosest1(int[][] points, int K) {
Arrays.sort(points, new Comparator<int[]>() {
public int compare(int[] point1, int[] point2) {
return (point1[0] * point1[0] + point1[1] * point1[1]) - (point2[0] * point2[0] + point2[1] * point2[1]);
}
});
return Arrays.copyOfRange(points, 0, K);
}