Unique Morse Code Words(LeetCode Algorithm 804)

2019年05月10日 |

leetcode/ algorithm/ easy

| algorithm

原题

804. 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:

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

Now, given a list of words, each word can be written as a concatenation of the Morse code of each letter. For example, “cba” 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.

原题地址：https://leetcode.com/problems/unique-morse-code-words/

思路

这题的思路应该是比较简单的。
首先字母和对应的摩斯码组成一个map。
然后用另一个map的key来存传入的参数对应的摩斯码。
最后看这个map有多大就知道有多少个不同的摩斯码了。

实现

Golang实现

https://github.com/cook-coder/my-leetcode-solution/tree/master/easy/804

成绩