一、题目链接
http://noi.openjudge.cn/ch0109/09/
二、解题思路
三、实施步骤
四、Java程序
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public int getMax(int[] nums) {
int n = nums.length;
int ans = nums[0];
for (int i = 1; i < n; i++) {
ans = (ans < nums[i] ? nums[i] : ans);
}
return ans;
}
public int[] countOccur(int[] nums) {
int[] occur = new int[10000];
for (int e : nums) {
occur[e]++;
}
return Arrays.copyOfRange(occur, 0, getMax(nums) + 1);
}
public static void main(String[] args) {
Main test = new Main();
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = input.nextInt();
}
int[] count = test.countOccur(nums);
for (int e : count) {
System.out.println(e);
}
}
}