[SWEA-D2] 1204. 최빈수 구하기

▶문제설명

[SWEA] 1204. 최빈수 구하기

https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE

▶Solution

---

import java.util.Scanner;
import java.io.FileInputStream;
import java.util.*;
 
class Solution{
    
    public static void main(String args[]) throws Exception
    {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        int order = 0;
        while(0 < T)
        {
            int[] check = new int[101];
            int answer = 0;
            order = sc.nextInt();
            for(int i =0 ; i<1000 ; i++){
                int idx = sc.nextInt();
                check[idx]++;
            }
            int max = -1;
            for(int i = 0 ; i<=100 ; i++){
                if(max <= check[i]){
                    max = check[i];
                    answer = i;
                }
            }
            System.out.printf("#%d %d\n",order, answer);
            T--;
        }
    }
}