JCorpse
0%

Unique Morse Code Words

發表於 更新於 分類於

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:

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

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:

1
2
3
4
　　　"gin" -> "--...-."
　　　"zen" -> "--...-."
　　　"gig" -> "--...--."
　　　"msg" -> "--...--."

There are 2 different transformations, “–…-.” and “–…–.”.
Note:
　　　1.The length of words will be at most 100.
　　　2.Each words[i] will have length in range [1, 12].
　　　3.words[i] will only consist of lowercase letters.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        int a = 0;
        Set<String> Morsecodes =new HashSet<String>();
        for(String word: words){
        	Morsecodes.add(ConvertMorsecode(word));
        }
    	return Morsecodes.size();
    }
    
    private String ConvertMorsecode(String word) {
		// TODO Auto-generated method stub
    	char[] wordArray = word.toCharArray();
    	String[] Morsecode = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."}; 
    	String Convertcode = new String();
    	for(char w_c : wordArray){
    		Convertcode+=Morsecode[w_c-'a'];
    	}
    	return Convertcode;
	}
}