804. Unique Morse Code Words (Google)

International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" maps to "-...", "c" maps to "-.-.", and so on.

For convenience, the full table for the 26 letters of the English alphabet is given below:

[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

Now, given a list of words, each word can be written as a concatenation of the Morse code of each letter. For example, "cab" can be written as "-.-.-....-", (which is the concatenation "-.-." + "-..." + ".-"). We'll call such a concatenation, the transformation of a word.

Return the number of different transformations among all words we have.

Example:
Input: words = ["gin", "zen", "gig", "msg"]
Output: 2
Explanation: 
The transformation of each word is:
"gin" -> "--...-."
"zen" -> "--...-."
"gig" -> "--...--."
"msg" -> "--...--."

There are 2 different transformations, "--...-." and "--...--.".

 

Note:

• The length of words will be at most 100.
• Each words[i] will have length in range [1, 12].
• words[i] will only consist of lowercase letters.

<SOLVE>

class Solution {
    static String [] mossCode = { ".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.." };
   
    public int uniqueMorseRepresentations(String[] words) {
        Map <String, Integer> map = new HashMap<String, Integer>();
       
        char a = 'a';
        for(int j=0 ; j<words.length; j++) {
            StringBuffer input = new StringBuffer();
            for(int i=0; i<words[j].length(); i++) {
                //System.out.print((int)words[j].charAt(i) - 97);
                input.append(mossCode[(int)words[j].charAt(i) - 97]);
            }
            map.put(input.toString(), 0);
        }
        return map.size();
    }
}