集合求最大最小优化版本:
package jihehuizong;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Homework2 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println(“请输入5位学院的成绩”);
//定义容器,用来存放数据
ArrayList<Float> scoreList = new ArrayList<Float>();
//定义一个累加器,来计算平均分
Float sum = 0F;
for (int i = 0; i < 5; i++) {
float score = input.nextFloat();
sum+=score;
scoreList.add(score);
}
//首先找最高分
//对List集合进行排序
Collections.sort(scoreList);
//此处已经找出了最高分最低分
int index = scoreList.size()-1;
Float maxScore = scoreList.get(index);
System.out.println("考试成绩最高分为: "+maxScore);
System.out.println("平均分="+(sum)/5);
System.out.println("===================================");
//遍历集合
scoreList.forEach(temp->{
System.out.print(temp+"\t");
});
}
}