题目描述:
两点距离
时间限制:
3000 ms | 内存限制:
65535 KB
难度:
1
-
描述
-
输入两点坐标(X1,Y1),(X2,Y2)(0<=x1,x2,y1,y2<=1000),计算并输出两点间的距离。
-
输入
-
第一行输入一个整数n(0<n<=1000),表示有n组测试数据;
随后每组占一行,由4个实数组成,分别表示x1,y1,x2,y2,数据之间用空格隔开。
输出
- 对于每组输入数据,输出一行,结果保留两位小数。 样例输入
-
2 0 0 0 1 0 1 1 0
样例输出
-
1.00 1.41
-
第一行输入一个整数n(0<n<=1000),表示有n组测试数据;
代码求解:
1.这是一个运行超时的代码~
package 语言入门; /* * Dragon 2017.8.10 * 求解两点之间的距离 */ import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.math.BigDecimal; import java.util.StringTokenizer; public class Num_101 { public static void main(String[] args) throws IOException { long startTime=System.currentTimeMillis(); BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); int count = getInt(in.readLine()); int x1,y1,x2,y2 = 0; long endTime=0; for(int i=0;i<count;i++) { StringTokenizer st = new StringTokenizer(in.readLine()); x1=getInt(st.nextToken()); y1=getInt(st.nextToken()); x2=getInt(st.nextToken()); y2=getInt(st.nextToken()); String result=getDistance(x1,y1,x2,y2); System.out.println(result); endTime=System.currentTimeMillis(); } System.out.println("程序运行时间: "+(endTime-startTime)+"ms"); } private static String getDistance(double x1, double y1, double x2, double y2) { double result=Math.sqrt(Math.pow(x1-x2, 2)+Math.pow(y1-y2, 2)); BigDecimal resultString=new BigDecimal(result); resultString = resultString.setScale(2,resultString.ROUND_HALF_UP); return resultString.toString(); } private static int getInt(String readLine) { return Integer.parseInt(readLine); } }
2.这个是输入用的BufferedReader,代码超级简单,但还是超时。。。
package 语言入门;
/*
* Dragon 2017.8.10
* 求解两点之间的距离
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.util.StringTokenizer;
public class Num_101
{
public static void main(String[] args) throws IOException
{
long startTime=System.currentTimeMillis();
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
double count = getDouble(in.readLine());
double x1,y1,x2,y2 = 0;
long endTime=0;
for(int i=0;i<count;i++)
{
StringTokenizer st = new StringTokenizer(in.readLine());
x1=getDouble(st.nextToken());
y1=getDouble(st.nextToken());
x2=getDouble(st.nextToken());
y2=getDouble(st.nextToken());
double result=Math.pow(x1-x2, 2)+Math.pow(y1-y2, 2);
System.out.printf("%.2f\n",Math.sqrt(result));
endTime=System.currentTimeMillis();
}
System.out.println("程序运行时间: "+(endTime-startTime)+"ms");
}
private static double getDouble(String readLine)
{
return Double.parseDouble(readLine);
}
}
3.参考别人的代码,用的Scanner,其他的没区别,运行超级快!
package 语言入门;
/*
* Dragon 2017.8.10
* 求解两点之间的距离
*/
import java.io.IOException;
import java.util.Scanner;
public class Num_101
{
public static void main(String[] args) throws IOException
{
//long startTime=System.currentTimeMillis();
Scanner in=new Scanner(System.in);
int count=in.nextInt();
//long endTime=0;
for(int i=0;i<count;i++)
{
double x1=in.nextDouble();
double y1=in.nextDouble();
double x2=in.nextDouble();
double y2=in.nextDouble();
double result=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
System.out.printf("%.2f\n",Math.sqrt(result));
//endTime=System.currentTimeMillis();
}
//System.out.println("程序运行时间: "+(endTime-startTime)+"ms");
}
}