Algorithms/SW expert
[Java] 1204. [S/W문제해결 기본] 1일차 - 최빈수 구하기
by kyungsubbb
2021. 3. 24.
swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE&problemTitle=1204&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1
import java.util.*;
import java.io.*;
public class SWEA_1204 {
static HashMap<Integer, Integer> map;
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder("");
int T = Integer.parseInt(in.readLine());
for (int tc = 1; tc <= T; tc++) {
map = new HashMap<>();
in.readLine();
String[] val = in.readLine().split(" ");
for (int i = 0; i < val.length; i++) {
if (!map.containsKey(Integer.parseInt(val[i]))) {
map.put(Integer.parseInt(val[i]), 1);
} else {
map.put(Integer.parseInt(val[i]), map.get(Integer.parseInt(val[i])) + 1);
}
}
int key = Integer.MIN_VALUE;
int value = Integer.MIN_VALUE;
for (int k : map.keySet()) {
if (map.get(k) >= value) {
key = k;
value = map.get(k);
}
}
sb.append("#").append(tc).append(" ").append(key).append("\n");
}
System.out.println(sb);
}
}