[SWEA] 1204. [S/W 문제해결 기본] 1일차 - 최빈수 구하기_JAVA

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

SW Expert Academy

 

1-1000까지의 배열을 만들어서 입력 받은 숫자의 번호의 배열을 ++시켜줍니다.

 

import java.util.Scanner;
import java.io.FileInputStream;

class Solution
{
	public static void main(String args[]) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		int T;
		T=sc.nextInt();
		for(int test_case = 1; test_case <= T; test_case++)
		{
            int [] map=new int[10001];
            int n=sc.nextInt();
            int max=0;
            for(int i=0;i<1000;i++){
                int index=sc.nextInt();
                map[index]++;
            }
            int x=0;
            for(int i=0;i<1000;i++){
                if(max<=map[i]){
                    max=map[i];
                    x=i;
                }
            }
            System.out.println("#"+test_case+" "+x);
		}
	}
}