LC 973. K Closest Points to Origin

Solution.java

class Solution {
    
    private double euclidDist(int[] p1, int[] p2) {
        return Math.sqrt( Math.pow(p1[0] - p2[0], 2) + Math.pow(p1[1] - p2[1], 2) );
    };
    
    public int[][] kClosest(int[][] points, int K) {
        int[] origin = new int[]{0,0};
        
        PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<int[]>() {
            public int compare(int[] p1, int[] p2) {
                double dist1 = euclidDist(p1, origin);
                double dist2 = euclidDist(p2, origin);
                if (dist1 > dist2) {
                    return 1;
                } else if (dist2 > dist1) {
                    return -1;
                } else {
                    return 0;
                }
            }
        });
        
        for (int[] point : points) {
            pq.add(point);
        }
        
        int[][] closest = new int[K][2];
        for (int i = 0; i < K; i++) {
            int[] point = pq.poll();
            closest[i] = point;
        }
        
        
        return closest;
    }
}