LeetCode_973_最接近远点的K个点

题目链接

• https://leetcode-cn.com/problems/k-closest-points-to-origin/

解题思路

• 直接计算距离然后使用lamba表达式返回前K个点

AC代码

class Solution {
    public int[][] kClosest(int[][] points, int K) {
        Arrays.sort(points, (point1, point2) -> (point1[0] * point1[0] + point1[1] * point1[1]) - (point2[0] * point2[0] + point2[1] * point2[1]));
        return Arrays.copyOfRange(points, 0, K);
    }
}

本地测试代码

package com.company;

import java.util.Arrays;

public class Solution_973 {
    public static int[][] kClosest(int[][] points, int K) {
        Arrays.sort(points, (point1, point2) -> (point1[0] * point1[0] + point1[1] * point1[1]) - (point2[0] * point2[0] + point2[1] * point2[1]));
        return Arrays.copyOfRange(points, 0, K);
    }

    public static void main(String[] args) {
        System.out.println(Arrays.deepToString(kClosest(new int[][]{{1, 3}, {-2, 2}}, 1)));
        System.out.println(Arrays.deepToString(kClosest(new int[][]{{3, 3}, {5, -1}, {-2, 4}}, 2)));
    }
}