难度不难,重点是游几个坑点,一开始理所当然以为中位数是平均值,然后理所当然错误了;
然后发现若是使用除法,默认只保留整数所以小数都是0,无法作为判断,所以必须使除数声明为double;
最后,得到的时间800ms,看起来很危险将近1s,要是数值再大一点的话要使用BufferedReader;
package com.example.administrator.test.ccf;
import java.util.Scanner;
/**
* @author kyp
* @time 2019/7/23
* @description 小中大 中位数,最大,最小,然后有序,可能升序或者降序
*/
public class _20190301 {
public static void main(String[] arsg) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.nextInt();
}
int max, min;
double middle = 0.0;//小数点保留一位数
if (a[n - 1] > a[0]) {
max = a[n - 1];
min = a[0];
} else {
max = a[0];
min = a[n - 1];
}
if (n % 2 != 0) {
middle = a[(n - 1) / 2];
System.out.print(max + " " + (int) middle + " " + min);
} else {
double sum =0.0;
sum= a[n / 2] + a[n / 2 - 1];
middle = sum / 2;
if( (middle-(int)middle) ==0){//重点是得到的值是整数还是小数
System.out.print(max + " " + (int) middle + " " + min);
}else {
System.out.print(max + " " + middle + " " + min);
}
}
}
}