【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.

解题思路
先定义一个trans函数：转化words为摩斯码表示
再用map函数使转化后的word合并
最后利用*len(set())*得到转化后不一样的字符串的数量

*python的ord()以一个字符作为参数，返回对应的ASCii数值，或者Unicode数值。

解答

class Solution:
    def uniqueMorseRepresentations(self, words):
        """
        :type words: List[str]
        :rtype: int
        """
        morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
        trans = lambda x: morse[ord(x) - ord('a')]
        map_word = lambda word:''.join([trans(x) for x in word])
        res = map(map_word,words)
        return len(set(res))