JAVA小练习.doc

Problem A 计算数字出现次数 Problem Description 编写程序，读取在1到100之间的整数，然后计算每个数出现的次数。假定输入是以0结束的。 注意：如果一个数的次数大于一次，就在输出时使用复数“times”。 测试示例 Test Case 1: Input 2 5 6 5 4 3 23 43 2 0 Output 2 occurs 2 times 3 occurs 1 time 4 occurs 1 time 5 occurs 2 times 6 occurs 1 time 23 occurs 1 time 43 occurs 1 time Test Case 2: Input 2 5 7 5 4 3 7 2 0 Output 2 occurs 2 times 3 occurs 1 time 4 occurs 1 time 5 occurs 2 times 7 occurs 2 time Test Case 3: Input 1 2 5 6 2 0 Output 1 occurs 1 time 2 occurs 2 times 5 occurs 1 time 6 occurs 1 time Test Case 4: Input 1 5 6 5 4 4 23 1 0 Output 1 occurs 2 times 4 occurs 2 time 5 occurs 2 times 6 occurs 1 time 23 occurs 1 time Test Case 5: Input 2 4 3 2 0 Output 2 occurs 2 times 3 occurs 1 time 4 occurs 1 time 程序代码 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 18 19 20 21 22 import java.util.Scanner; public class NumberCount { public static void main(String[] args) { // TODO code application logic here int[] NumberArray = new int[101]; Scanner input = new Scanner(System.in); while (input.hasNext()) { int temp = input.nextInt(); if (temp == 0) break; NumberArray[temp]++; } for (int i = 1; i NumberArray.length; i++) { if (NumberArray[i] == 1) System.out.println(i + occurs + NumberArray[i] + time); if (NumberArray[i] 1) System.out.println(i + occurs + NumberArray[i] + times); } } } Problem B 相同的数组 Problem Description 如果两个数组list1和list2的内容相同，那么就说他们是相同的。使用下面的方法头编写一个方法，如果list1和list2是相同的，该方法就返回true： public static boolean equal(int[] list1, int[] list2); 编写一个测试程序，提示用户输入两个整数数列，然后显示他们两个是否相同。 测试示例 Test Case 1: Input 5 2 5 6 6 1 5 5 2 6 1 6 Output Two lists are identical Test Case 2: Input 5 2 5 6 6 1 5 5 2 6 1 3 Output Two lists are not identical Test Case 3: Input 5 5 5 6 6 1 5 2 5 6 1 6 Output Two lists are not identical Test Case 4: Input