[Java] 백준 알고리즘 - 다이얼

import java.util.Scanner;
 
public class Main {
 
    public static void main(String[] args) {
 
        Scanner input = new Scanner(System.in);
 
        String number = input.nextLine();
 
        int[] alpha = new int[27];
        int time = 2;
        int index = 0;
 
        // A ~ O
        for (int i = 0; i < 5; i++) {
            time++;
 
            for (int j = 0; j < 3; j++) {
                index = 3 * i + j;
                alpha[index] = time;
            }
        }
 
        // P ~ Z
        for (int i = 1; i <= 3; i++) {
            time++;
 
            if (i % 2 == 1) {
                for (int j = 1; j <= 4; j++)
                    alpha[++index] = time;
            }
 
            else {
                for (int j = 1; j <= 3; j++)
                    alpha[++index] = time;
            }
        }
 
        int result = 0;
        for(int i = 0; i < number.length(); i++){
            result += alpha[number.charAt(i)-65];
        }
        
        System.out.println(result);
        
    }
}