leetcode 804. 唯一摩尔斯密码词

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        String[] a = new String[words.length];
        for (int i = 0; i < words.length; i++)
            a[i] = "";
        for (int i = 0; i < words.length; i++) {
            for (int j = 0; j < words[i].length(); j++) {
                switch(words[i].charAt(j)) {
                    case 'a':
                        a[i] = a[i] + ".-";
                        break;
                    case 'b':
                        a[i] = a[i] + "-...";
                        break;
                    case 'c':
                        a[i] = a[i] + "-.-.";
                        break;
                    case 'd':
                        a[i] = a[i] + "-..";
                        break;
                    case 'e':
                        a[i] = a[i] + ".";
                        break;
                    case 'f':
                        a[i] = a[i] + "..-.";
                        break;
                    case 'g':
                        a[i] = a[i] + "--.";
                        break;
                    case 'h':
                        a[i] = a[i] + "....";
                        break;
                    case 'i':
                        a[i] = a[i] + "..";
                        break;
                    case 'j':
                        a[i] = a[i] + ".---";
                        break;
                    case 'k':
                        a[i] = a[i] + "-.-";
                        break;
                    case 'l':
                        a[i] = a[i] + ".-..";
                        break;
                    case 'm':
                        a[i] = a[i] + "--";
                        break;
                    case 'n':
                        a[i] = a[i] + "-.";
                        break;
                    case 'o':
                        a[i] = a[i] + "---";
                        break;
                    case 'p':
                        a[i] = a[i] + ".--.";
                        break;
                    case 'q':
                        a[i] = a[i] + "--.-";
                        break;
                    case 'r':
                        a[i] = a[i] + ".-.";
                        break;
                    case 's':
                        a[i] = a[i] + "...";
                        break;
                    case 't':
                        a[i] = a[i] + "-";
                        break;
                    case 'u':
                        a[i] = a[i] + "..-";
                        break;
                    case 'v':
                        a[i] = a[i] + "...-";
                        break;
                    case 'w':
                        a[i] = a[i] + ".--";
                        break;
                    case 'x':
                        a[i] = a[i] + "-..-";
                        break;
                    case 'y':
                        a[i] = a[i] + "-.--";
                        break;
                    case 'z':
                        a[i] = a[i] + "--..";
                        break;
                }
            }
        }
        HashSet<String> set = new HashSet<>();
        for (int i = 0; i < a.length; i++) {
            set.add(a[i]);
        }
        return set.size();
    }
}