ÂùÁ¦·¨ºÍ·ÖÖη¨ Çó×î½ü¶ÔÎÊÌâ——Java ʵÏÖ

Éèp1=(x1, y1), p2=(x2, y2), …, pn=(xn, yn)ÊÇƽÃæÉÏn¸öµã¹¹³ÉµÄ¼¯ºÏS£¬Éè¼ÆËã·¨ÕÒ³ö¼¯ºÏSÖоàÀë×î½üµÄµã¶Ô¡£
ÂùÁ¦Ëã·¨ÃèÊö£º
int ClosestPoints(int n, int x[ ], int y[ ], int &index1, int &index2)
{
   minDist=+∞;
   for (i=1; i<n; i++)
      for (j=i+1; j<=n; j++)
     {
         d=(x[i]-x[j])* (x[i]-x[j])+(y[i]-y[j])* (y[i]-y[j]); 
         if (d<minDist) {
             minDist=d;
             index1=i;
             index2=j;
        }
      }
     return  minDist;
}
ClosestPair1.java                                         //ÂùÁ¦Ëã·¨
import java.util.*;
public class ClosestPair1
{
 public static void main(String[] args)
 {
  /**
   *ÊäÈëÐèÒª±È½ÏµÄµãµÄ¶ÔÊý´æÔÚ±äÁ¿nÖÐ
   */
  Scanner in=new Scanner(System.in);
  System.out.println("How many pairs of points to compare?(ÓжàÉÙ¶ÔµãÐèÒª±È½Ï?)");
  int n=in.nextInt();
  
  int[] x=new int[n];
  int[] y=new int[n];
  /**
   *ÊäÈëÕâЩµãµÄºá×ø±êºÍ×Ý×ø±ê·Ö±ð´æ´¢ÔÚx[n]ºÍy[n]
   */
  System.out.println("Please enter these points,X-coordinate(ÇëÊäÈëÕâЩµã,ºá×ø±ê):");
  for(int i=0;i<n;i++)
  {
   x[i]=in.nextInt();
  }
  
  System.out.println("Please enter