62,623
社区成员
发帖
与我相关
我的任务
分享
import java.util.*;
class StaticInnerClassDemo{
public static void main(String[] args){
Scanner in=new Scanner(System.in);
int num=in.nextInt();
double[] arr=new double[num];
for(int i=0; i<num; i++){
double v=in.nextDouble();
arr[i] = v;
}
ArraySort.Pair p=ArraySort.getPair(arr);
System.out.println("max="+p.getFirst());
System.out.println("min="+p.getLast());
}
}
class ArraySort {
public static class Pair{
private double first;
private double last;
public Pair(double first, double last) {
this.first = first;
this.last = last;
}
public double getFirst() {
return first;
}
public double getLast() {
return last;
}
}
public static Pair getPair(double[] arr) {
if (arr == null)
throw new NullPointerException("指针传递异常");
double max = arr[0]; //
double min = arr[0];
System.out.println(max + " " + min);
for (double v : arr) {
if (v > max)
max = v;
if (min > v)
min = v;
}
return new Pair(max, min);
}
}
class StaticInnerClassDemo {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int num = in.nextInt();
double[] arr = new double[num];
// for (double v : arr) //for each 不能赋值!
// v = in.nextDouble();
for(int i=0;i<arr.length;i++){
arr[i]=in.nextDouble();
}
System.out.println(Arrays.toString(arr));
ArraySort.Pair p = ArraySort.getPair(arr);
System.out.println("max=" + p.getFirst());
System.out.println("min=" + p.getLast());
}
}
class ArraySort {
public static class Pair {
private double first;
private double last;
public Pair(double first, double last) {
this.first = first;
this.last = last;
}
public double getFirst() {
return first;
}
public double getLast() {
return last;
}
}
public static Pair getPair(double[] arr) {
if (arr == null)
throw new NullPointerException("指针传递异常");
double max = arr[0]; //
double min = arr[0];
System.out.println(max + " " + min);
for (double v : arr) {
if (v > max)
max = v;
//if (min < v) 这个写反了
if (v < min)
min = v;
}
return new Pair(max, min);
}
}