[BOJ] 1969 DNA (JAVA)

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

1969번: DNA

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

public class Main {
	
    public static void main(String[] args) throws Exception {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        int N = Integer.parseInt(st.nextToken());
        int M = Integer.parseInt(st.nextToken());
        String[] input = new String[N];
        for (int i = 0; i < N; i++) {
            input[i] = br.readLine();
        } // end of input

        String result = "";
        int hd = 0;
        char[] dna = { 'A', 'C', 'G', 'T' };
        int[] cnt;

        for (int j = 0; j < M; j++) {

            cnt = new int[4];

            for (int i = 0; i < N; i++) {

                char c = input[i].charAt(j);

                switch (c) {
                    case 'A' :
                        cnt[0]++;
                        break;
                    case 'C' :
                        cnt[1]++;
                        break;
                    case 'G' :
                        cnt[2]++;
                        break;
                    case 'T' :
                        cnt[3]++;
                        break;
                }

            }

            int max = 0;
            int index = 0;

            for (int i = 0; i < 4; i++) {
                if (max < cnt[i]) {
                    max = cnt[i];
                    index = i;
                }
            }

            result += dna[index];
            hd += N - cnt[index];

        }

        System.out.print(result + "\n" + hd);

    }

}