如何在Java中编写一个函数来查找二维数组中最近的两个点？

public class ClosestPointsFinder {
    public static void main(String[] args) {
        int[][] points = {{1, 2}, {3, 4}, {5, 6}, {7, 8}, {9, 10}};
        int[] closestPoints = findClosestPoints(points);
        System.out.println("Closest points: (" + closestPoints[0] + ", " + closestPoints[1] + ") and (" + closestPoints[2] + ", " + closestPoints[3] + ")");
    }

    public static int[] findClosestPoints(int[][] points) {
        int[] closestPoints = new int[4];
        double minDistance = Double.MAX_VALUE;

        for (int i = 0; i < points.length; i++) {
            for (int j = i + 1; j < points.length; j++) {
                int x1 = points[i][0];
                int y1 = points[i][1];
                int x2 = points[j][0];
                int y2 = points[j][1];

                double distance = Math.sqrt(Math.pow((x2 - x1), 2) + Math.pow((y2 - y1), 2));

                if (distance < minDistance) {
                    minDistance = distance;
                    closestPoints[0] = x1;
                    closestPoints[1] = y1;
                    closestPoints[2] = x2;
                    closestPoints[3] = y2;
                }
            }
        }

        return closestPoints;
    }
}