Update LineSweep.java

If i starts with 1, then the first point will never be added to the candidates set so it will not be considered as a candidate to other points.
Check this example.
4
-1 0
0 100
0 200
1 0

The closest distance between the first and the fourth point is 2 but the current solution will result in d = 100.

Author: omaryasser

geometry/LineSweep.java

@@ -21,7 +21,7 @@ public static void main(String[] args) throws NumberFormatException, IOException
 		Arrays.sort(points, new X());
 
 		double d = 1e9;		
-		for(int i = 1, left = 0; i < points.length; i++)
+		for(int i = 0, left = 0; i < points.length; i++)
 		{
 			int px = points[i].x, py = points[i].y;
 			while(left < i && px - points[left].x > d + EPS) cands.remove(points[left++]);