[백준 알고리즘] Q5622 다이얼

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 = sc.nextLine(); // UNUCIC는 868242 A == 65
		int[] phone = {
				3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7,
				8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10
		};
		
		printResult(phone, input);
	}
	
	public static void printResult(int[] arr, String input) {
		int result = 0;
		for(int i = 0; i < input.length(); i++) {
			int idx = (int)(input.charAt(i)) - 65;
			result += arr[idx];
		}
		
		System.out.println(result);
	}
}