Closest Pair of Point代码有bug，希望得到指点（java）

算是非常经典的一道题：输入n个点的横纵坐标，求所有点对之中最短距离。基本思路就是分治法。自己实在debug不出来。有一个数据量非常大的case没有通过。请大家帮忙看看，谢谢！这里给出OJ的链接https://www.lintcode.com/problem/966/description。


[i][i][i][/i][/i][/i][i][i][i][i][i]

1. [/i][/i][/i][/i][/i][/i]
   
2. [i][i][i][i][i][i]public class Solution {
   
3.     /**
   
4.      * @param x: the list of coordinate x
   
5.      * @param y: the list of coordinate y
   
6.      * @return: find the closest pair of points and return the distance
   
7.      */
   
8.     public double getClosestDistance(double[] x, double[] y) {
   
9.         int n = x.length;
   
10.         Point[] points = new Point[n];
    
11.         for (int i = 0; i < n; i++)
    
12.             points = new Point(x, y);
    
13.         Arrays.sort(points, (a,b)->(Double.compare(a.x, b.x)));
    
14.         return split(points, 0, n-1);
    
15.     }
    
16. 
    
17. 
    
18.     private double bruteForce(Point[] points, int start, int end) {
    
19.         double min = Integer.MAX_VALUE;
    
20.         for (int i = start; i <= end; i++)
    
21.             for (int j = i+1; j <= end; j++)
    
22.                 min = Math.min(min, Point.distance(points, points[j]));
    
23.         return min;
    
24.     }
    
25. 
    
26.     private double split(Point[] points, int start, int end) {
    
27.         int n = end-start+1;
    
28.         if (n <= 3) return bruteForce(points, start, end);
    
29.         Point midX = points[n/2];
    
30.         double dl = split(points, start, start+n/2);
    
31.         double dr = split(points, start+n/2+1, end);
    
32.         double d = Math.min(dl, dr);
    
33.         List<Point> middles = new ArrayList();
    
34.         for (int i = start; i <= end; i++) {
    
35.             if (Math.abs(points.x - midX.x) <= d)
    
36.                 middles.add(points);
    
37.         }
    
38.         return Math.min(d, crossRegionMin(middles, d));
    
39.     }
    
40. 
    
41.     private double crossRegionMin(List<Point> points, double min) {
    
42.         Collections.sort(points, (a,b)->(Double.compare(a.y, b.y)));
    
43.         for (int i = 0; i < points.size(); i++) {
    
44.             for (int j = i+1; j < points.size(); j++) {
    
45.                 if (points.get(j).y - points.get(i).y >= min)
    
46.                     break;
    
47.                 if (Point.distance(points.get(i), points.get(j)) < min)
    
48.                     min = Point.distance(points.get(i), points.get(j));
    
49.             }
    
50.         }
    
51.         return min;
    
52.     }
    
53. }
    
54. 
    
55. class Point {
    
56.     double x, y;
    
57. 
    
58.     public Point(double x_, double y_) {
    
59.         x = x_;
    
60.         y = y_;
    
61.     }
    
62. 
    
63.     public static double distance(Point a, Point b) {
    
64.         return Math.sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));
    
65.     }
    
66. } [/i][/i][/i][/i][/i][/i]
    
67. [i][i][i][i][i][i]

复制代码

[/i][/i][/i][/i][/i]

顶一下帖子，希望不要沉了

求各位大神指点一下呀