Java如何计算数组中数字的出现？
package org.nhooo.example.lang;
import java.util.HashMap;
import java.util.Map;
public class NumberOccurrenceInArray {
public static void main(String[] args) {
int[] numbers = new int[]{1, 8, 3, 4, 3, 2, 5, 7, 3, 1, 4, 5, 6, 4, 3};
Map<Integer, Integer> map = new HashMap<>();
for (int key : numbers) {
if (map.containsKey(key)) {
int occurrence = map.get(key);
occurrence++;
map.put(key, occurrence);
} else {
map.put(key, 1);
}
}
for (Integer key : map.keySet()) {
int occurrence = map.get(key);
System.out.println(key + " occur " + occurrence + " time(s).");
}
}
}结果是：
1 occur 2 time(s). 2 occur 1 time(s). 3 occur 4 time(s). 4 occur 3 time(s). 5 occur 2 time(s). 6 occur 1 time(s). 7 occur 1 time(s). 8 occur 1 time(s).
热门推荐
1 如何训练狗狗不叫
2 训练狗狗不叫
3 训练狗狗随行
4 怎么训练狗狗不叫
7 训练比熊狗狗教程
10 上海狗狗训练
11 怎么训练狗狗上厕所
12 训练狗狗趴下
13 狗狗服从训练
14 训练狗狗拒食
15 训练狗狗笑
16 训练狗狗大便
17 训练狗狗立
18 训练狗狗捡东西