[백준 알고리즘] Q1157 단어공부

1. Java 구현

         
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		/* 2018.08.08 */	
		Scanner sc = new Scanner(System.in);
		String input = getInput(sc);
		
		int[] cntArr = initArr(input);

		String result = getResult(cntArr);
		
		System.out.println(result);
	}
	
	public static String getInput(Scanner sc) {
		String input = sc.nextLine();
		return input.toUpperCase();
	}
	
	public static int[] initArr(String str) {
		int[] arr = new int[26];
		for(int i = 0; i < str.length(); i++) {
			int idx = str.charAt(i) - 65;
			arr[idx]++;
		}
		
		return arr;
	}
	
	public static String getResult(int[] arr) {
		String result = "";
		int max = 0;
		for(int i = 0; i < arr.length; i++) {
			if(arr[i] >= max) {
				if(arr[i] == max) {
					result = "?";
				} else {
					result = (char)(i + 65) + "";
				}
				max = arr[i];
			}
		}
		return result;
	}

}