leetcode/Python/unique-morse-code-words.py at master · OnlyChristmas/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
'''
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.

'''


class Solution:
    def uniqueMorseRepresentations(self, words):
        """
        :type words: List[str]
        :rtype: int
        """


        # method one   不够简洁,输入构造麻烦
        # ref = {'a':".-",
        #        "b":"-...",
        #        "c":"-.-.",
        #        "d":"-..",
        #        "e":".",
        #        "f":"..-.",
        #        "g":"--.",
        #        "h":"....",
        #        "i":"..",
        #        "j":".---",
        #        "k":"-.-",
        #        "l":".-..",
        #        "m":"--",
        #        "n":"-.",
        #        "o":"---",
        #        "p":".--.",
        #        "q":"--.-",
        #        "r":".-.",
        #        "s":"...",
        #        "t":"-",
        #        "u":"..-",
        #        "v":"...-",
        #        "w":".--",
        #        "x":"-..-",
        #        "y":"-.--",
        #        "z":"--.."}
        # res = []
        # for word in words:
        #     s = ''
        #     for i in  word:
        #         s += ref.get(i)
        #     res.append(s)
        # return len(set(res))


        # method two   用ord()函数求出a的ASCII值, chr() 是将ASCII值变为字符.  ord('a') = 97 ,   ord("A") = 65


        ref = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

        return len(set("".join(ref[ord(s) - 97] for s in word) for word in words))