3. 최빈수 찾기

package _3;

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

public class Main {

	public static void main(String[] args) {
		
		int[] arr = new int[15];
		int cnt = 0;		
		int max = 0;
		HashMap<Integer, Integer> cntMap = new HashMap<Integer, Integer>();
		
		Scanner scan = new Scanner(System.in);
		System.out.print("숫자 " + arr.length + "개 입력 >> ");
		for (int i = 0; i < arr.length; i++) {
			arr[i] = scan.nextInt();
		}
		
		for (int i = 0; i < arr.length; i++) {
			int curVal = arr[i];			
			for (int j = 0; j < arr.length; j++) {				
				if(curVal == arr[j]) {
					cnt++;
				}
			}			
			if(max <= cnt) {				
				if(max == cnt) {
					max = cnt;
					cntMap.put(curVal, max);
				}else {
					max = cnt;
					cntMap.clear();
					cntMap.put(curVal, max);
				}				
			}			
			cnt = 0;
		}
		for(int key : cntMap.keySet()) {
			System.out.println(key + " : " + cntMap.get(key) + "회");
		}		
	}	
}