[Java] 백준_3059_등장하지않는문자의합

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
   static BufferedReader input = new BufferedReader (new InputStreamReader(System.in));
   static StringBuilder output = new StringBuilder();
   static StringTokenizer tokens;
   static int T;
   static int alphabet = 26;
   public static void main(String[] args) throws IOException {
        T = Integer.parseInt(input.readLine());
        for(int t=0; t<T; t++){
            String line = input.readLine();
            int sum = 0;
            boolean[] alpha = new boolean[alphabet];
            int N = line.length();
            for(int n=0; n<N; n++){
                alpha[line.charAt(n) - 'A'] = true;
            }
            for(int i=0; i<alphabet; i++){
                if(!alpha[i]){
                    sum+= i+'A';
                }
            }
            output.append(sum).append("\n");
        }
       System.out.println(output);
    }
}

 

https://www.acmicpc.net/problem/3059

3059번: 등장하지 않는 문자의 합