第五章第四十一题(最大数的出现次数)(Occurrence of max numbers)

第五章第四十一题(最大数的出现次数)(Occurrence of max numbers)

  • *5.41(最大数的出现次数)编写程序读取整数,找出它们的最大数,然后计算该数的出现次数。假设输入是以0结束的。假定输入是3 5 2 5 5 5 0,程序找出最大数5,而5出现的次数是4。
    Enter numbers: 3 5 2 5 5 5 0
    The largest number is 5
    The occurrence count of the largest number is 4
    *5.41 (Occurrence of max numbers) Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume the input ends with number 0. Suppose you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4.
    Enter numbers: 3 5 2 5 5 5 0
    The largest number is 5
    The occurrence count of the largest number is 4
  • 参考代码:
package chapter05;

import java.util.Scanner;

public class Code_41 {
    public static void main(String[] args) {
        int max = 1,count = 1;
        Scanner input = new Scanner(System.in);
        System.out.print("Enter numbers: ");
        int number = input.nextInt();
        while (number != 0){
            if(number == max)
                count++;
            if (number > max){
                max = number;
                count = 1;
            }
            number = input.nextInt();
        }
        System.out.println("The largest number is " + max);
        System.out.println("The occurrence count of the largest number is " + count);
    }
}

  • 结果显示:
Enter numbers: 3 5 2 5 5 5 0
The largest number is 5
The occurrence count of the largest number is 4

Process finished with exit code 0

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值