[swift] LeetCode 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, “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.

let morseCode = ["a": "01", "b": "1000", "c": "1010", "d": "100", "e": "0", "f": "0010", "g": "110", "h": "0000", "i": "00", "j": "0111", "k": "101", "l": "0100", "m": "11", "n": "10", "o": "111", "p": "0110", "q": "1101", "r": "010", "s": "000", "t": "1", "u": "001", "v": "0001", "w": "011", "x": "1001", "y": "1011", "z": "1100"]
return Set(
        words.map { w in
            w.reduce("") { s, c in
                s + morseCode[String(c)]!
            }
        }).count

（随着网站访问量的激增，服务器配置只得一再升级以维持网站不“404 Not Found”，所以网站的维护费用也在不断上涨……（目前的阿里云服务器ECS+云数据库RDS+域名购买+七牛云的费用是2200元/年），为了能不放弃该网站，所以我又把打赏链接放上来啦～所有打赏金额都会被记账并投入博客维护中，感谢厚爱，多多关照～）