找素材去哪个网站,建设工程施工合同范本最新版,傻瓜式做网站,打开网站无反应怎么做在有限点中找出距离最近的点#xff0c;要求用二维数组且为浮点型#xff08;Double)编写#xff0c;编写一个distance方法计算距离在主方法中来比较
输入#xff1a;输入点的个数和坐标点#xff08;不需要括号和逗号#xff09;
8-1 3 -1 -1 1 1 2 0.5 2 -1 3 3 4 2 …在有限点中找出距离最近的点要求用二维数组且为浮点型Double)编写编写一个distance方法计算距离在主方法中来比较
输入输入点的个数和坐标点不需要括号和逗号
8-1 3 -1 -1 1 1 2 0.5 2 -1 3 3 4 2 4 -0.5输出输出距离最近的点的坐标
Enter the number of points:
Enter points:The closest two points are (1.0,1.0) and (2.0,0.5)import java.util.Scanner;public class FindNearestPoints {public static void main(String[] args) {Scanner input new Scanner(System.in);System.out.print(Enter the number of points: );int numberOfPoints input.nextInt();//Create an array to store pointsdouble[][] points new double[numberOfPoints][2];System.out.print(Enter numberOfPoints points: );for (int i 0; i points.length; i) {points[i][0] input.nextDouble();points[i][1] input.nextDouble();}//p1 and p2 are the indices in the points arrayint p1 0, p2 1;double shortestDistance distance(points[p1][0],points[p1][1],points[p2][0],points[p2][1]);//Compute distance for every two pointsfor (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 (shortestDistance distance){p1 i;p2 j;shortestDistance distance;}}}//Display resultSystem.out.println(The closest two points are ( points[p1][0] , points[p1][1] ) and ( points[p2][0] , points[p2][1] ));}public static double distance(double x1,double y1,double x2,double y2){return Math.sqrt((x2 - x1)*(x2 - x1) (y2-y1)*(y2-y1));}
}
