Introduction to Java Programming编程题6.3<计算数字的出现次数>

原创于 2015-08-19 18:19:57 发布 · 475 阅读

0 ·

CC 4.0 BY-SA版权

Java 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一个Java程序，用于从用户输入的一系列1到100之间的整数中统计每个不同整数出现的次数，并按升序输出这些整数及其出现次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*
Enter the integers between 1 and 100: 2 5 6 5 4 3 23 43 2 0
2 occurs 2 times.
3 occurs 1 times.
4 occurs 1 times.
5 occurs 2 times.
6 occurs 1 times.
23 occurs 1 times.
43 occurs 1 times.
 */
import java.util.Scanner;
import java.util.Arrays;

public class OcussDigitSeconds {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        final int SIZE = 20;
        int i = 0;
        int[] number = new int[SIZE];
        int temp;

        System.out.print("Enter the integers between 1 and 100: ");
        while (i < SIZE && (temp = input.nextInt()) != 0) {
            if (temp > 0 && temp < 100)
                number[i++] = temp;
        }

        final int LEN = i;
        Arrays.sort(number, 0, LEN);
        int index = 0;
        int[] times = new int[LEN];

        for (i = 0; i < LEN; i++) {
            times[index] = 1;
            while (number[i] == number[i + 1]) {
                times[index]++;
                i++;
            }
            index++;
        }

        for (i = 0, index = 0;i < LEN; i += times[index], index++)
            System.out.println(number[i] + " occurs " + times[index] + " times.");
    }
}