[SW Expert Academy] [S/W 문제해결 기본] 1일차 - 최빈수 구하기

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=1

SW Expert Academy

import java.util.HashMap;
import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= 10; tc++) {
			t = sc.nextInt();

			HashMap<Integer, Integer> map = new HashMap<>();

			for (int i = 0; i < 1000; i++) {
				int num = sc.nextInt();
				map.put(num, map.getOrDefault(num, 0) + 1);
			}

			int max = Integer.MIN_VALUE;

			for (int i = 0; i <= 100; i++) {
				max = Math.max(max, map.get(i));
			}

			int ans = -1;

			for (int i = 0; i <= 100; i++) {
				if (map.get(i) == max) {
					ans = Math.max(ans, i);
				}
			}

			System.out.println("#"+tc+" "+ans);

		}
	}
}

 

HashMap에 넣어서 get으로 최댓값을 갱신했다.