package com.example.administrator.test.ccf;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
/**
* 出现次数最多的数字
* count 100 time 203ms space 24.87MB
*/
public class _20131201 {
public static void main(String[] args) {
HashMap<Integer, Integer> map = new HashMap<>();//key为输入的值,值为出现的次数
Scanner scaner = new Scanner(System.in);
int n = scaner.nextInt();
if (n < 1 || n > 1000) {
return;
}
for (int i = 0; i < n; i++) {
int num = scaner.nextInt();
if (map.containsKey(num)) {
map.put(num, map.get(num) + 1);
} else {
map.put(num, 1);
}
}
scaner.close();
int pNum = 10000;
Integer maxCount = Collections.max(map.values());
for (Map.Entry<Integer, Integer> m : map.entrySet()) {
if (m.getValue() == maxCount) {
int p = m.getKey();
if (p < pNum) {
pNum = p;
}
}
}
System.out.println(pNum);
}
}
CCF(Java)系列之出现次数最多的数(_20131201)
最新推荐文章于 2024-03-30 22:19:29 发布