用Java编程100道问题//3最近点距离（不用分治）

//最近点距离（不用分治法，改编得）

在这里插入代码片
import java.util.Scanner;
public class Main{
public static void main(String[] args){
  Scanner scan=new Scanner(System.in);
  int n=scan.nextInt();
  int[][] points=new int[n][2];
  for(int i=0;i<points.length;i++){
    points[i][0]=scan.nextInt();
    points[i][1]=scan.nextInt();
  }
  int p1=0,p2=1;
  double minDistance=distance(points[p1][0],points[p1][1],points[p2][0],points[p2][1]);
  for(int i=0;i<points.length;i++) {
    for(int j=i+1;j<points.length;j++) {
      double distance=distance(points[i][0],points[i][1],points[j][0],points[j][1]);
  
  if(minDistance>distance){
    p1=i;
    p2=j;
    minDistance=distance;
    } 
  }
}
  System.out.printf("%.2f",minDistance);
  System.out.println();}
  public static double distance(int x1,int y1,int x2,int y2){
    return Math.sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
  }
}