• 문제 링크
https://www.acmicpc.net/problem/24776
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
Map<String, Integer> map = new HashMap<>();
String key, res = "";
int val, max = 0;
while (!(key = br.readLine()).startsWith("*")) {
map.put(key, map.getOrDefault(key, 0) + 1);
if (max < (val = map.get(key))) {
max = val;
res = key;
} else if (max == val) res = "Runoff!";
}
bw.write(res);
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 5366 Total Count - Data Structure / Java (0) | 2024.06.01 |
---|---|
[백준] 18703 Duplicate Files - Data Structure / Java (0) | 2024.05.31 |
[백준] 7800 The Chosen Sub Matrix - Data Structure / Java (0) | 2024.05.29 |
[백준] 9863 Calling All Programmers - Data Structure / Java (0) | 2024.05.28 |
[백준] 25643 문자열 탑 쌓기 - Brute Force / Java (0) | 2024.05.27 |
댓글