*5.9(找出分数最高的前两个学生)编写程序,提示用户输入学生的个数、每个学生的名字及其分数,最后显示获得最高分的学生和第二高分的学生。使用Scanner类的next()方法而不是nextLine()方法来读取名字。
*5.9 (Find the two highest scores) Write a program that prompts the user to enter the number of students and each student’s name and score, and finally displays the names of the students with the highest and second-highest scores.Use the next() method in the Scanner class to read a name, rather than using the nextLine() method.
下面是参考答案代码:
import java.util.*;
public class FindTheTwoHighestScoresQuestion9 {
public static void main(String[] args) {
int numberOfStudent;
double firstHighestScore = 0, secondHighestScore = 0, tempScore;
String firstStudentName = "", secondStudentName = "", tempName;
Scanner inputScanner = new Scanner(System.in);
System.out.print("Enter the number of the students:");
numberOfStudent = inputScanner.nextInt();
if(numberOfStudent > 0)
{
for(int i = 1;i <= numberOfStudent;i++)
{
System.out.print("Enter the student's name: ");
tempName = inputScanner.next();
System.out.print("Enter the student's score: ");
tempScore = inputScanner.nextDouble();
if(tempScore > firstHighestScore)
{
secondStudentName = firstStudentName;
secondHighestScore = firstHighestScore;
firstStudentName = tempName;
firstHighestScore = tempScore;
continue;
}
if(tempScore > secondHighestScore)
{
secondStudentName = tempName;
secondHighestScore = tempScore;
}
}
System.out.println("The name of the student with the highest score is " + firstStudentName);
System.out.println("The name of the student with the second-highest score is " + secondStudentName);
}
else
System.out.println("The number of the students is less than or equals to 0n"
+ "Invalid input");
inputScanner.close();
}
}
运行效果:
注:编写程序要养成良好习惯
1.文件名要用英文,具体一点
2.注释要英文
3.变量命名要具体,不要抽象(如:a,b,c等等),形式要驼峰化
4.整体书写风格要统一(不要这里是驼峰,那里是下划线,这里的逻辑段落空三行,那里相同的逻辑段落空5行等等)
5.普通变量,方法名要小驼峰,类名要大驼峰,常量要使用全部大写加上下划线命名法
6.要学习相应的代码编辑器的一些常用快捷键,如:快速对齐等等
最后
以上就是酷炫火车最近收集整理的关于第五章第九题(找出分数最高的前两个学生)(Find the two highest scores)的全部内容,更多相关第五章第九题(找出分数最高的前两个学生)(Find内容请搜索靠谱客的其他文章。
本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
发表评论 取消回复