최빈수 구하기 문제

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

SW Expert Academy

 

<해당 문제는 삼성 sw expert 아카데미의 문제에 저작권이 있습니다> 

 

 

 

 

package codingProblem;

import java.util.Scanner;

public class repeatNumber {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		scan.nextLine();

		for (int j = 0; j < T; j++) {
			int num = scan.nextInt();
			scan.nextLine();
			String str1 = scan.nextLine();
			String[] arr = str1.split(" ");
			int[] index = new int[101];
			int max = 0;

			for (int i = 0; i < arr.length; i++) {
				int value = Integer.parseInt(arr[i]);
				index[value]++;

				if (index[value] > max) {
					max = index[value]; // max값 결정됨.
				}

			}

			for (int i = 100; i >= 0; i--) {
				if (index[i] == max) {
					System.out.println("#" + num + "  " + i);
					break;
				}

			}

		}

	}

}