输出最大的数及其出现的次数。输入1个整数,如果该整数不是0,则继续输入,直到输入0时为止。查找这一组数中最大的数,并输出最大的数出现的次数。如果输入的第一个数为0,就输出:“Only 0 is inputed”。
实现参考如下:
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int max = 0;
int count = 0;
int num;
System.out.println("请输入一个整数: ");
num = input.nextInt();
if (num == 0) {
System.out.println ("Only 0 is inputed ");
}
while(num != 0) {
num = scan.nextInt();
if (num > max) {
max = num;
count = 1;
} else if (num == max) {
count++;
}
}
System.out.println("当前输入的最大数为:" + max + "\n");
System.out.println("当前最大数的出现次数为:" + count);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int max = Integer.MIN_VALUE;
int count = 0;
System.out.print("Please enter an integer (0 to quit): ");
int num = input.nextInt();
if (num == 0) {
System.out.println("Only 0 is inputed");
return;
}
while (num != 0) {
if (num > max) {
max = num;
count = 1;
} else if (num == max) {
count++;
}
System.out.print("Please enter an integer (0 to quit): ");
num = input.nextInt();
}
System.out.println("The maximum number is " + max + " and it appears " + count + " times.");
}
}