LeetCode/String/uniqueMorseRepresentations.py at master · konantian/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
#Source : https://leetcode.com/problems/count-and-say/
#Author : Yuan Wang
#Date   : 2018-07-04
'''
**********************************************************************************
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 "--...--.".
**********************************************************************************/
'''

#Self solution, Time complexity:O(n) Space complexity:O(n)
def uniqueMorseRepresentations(words):
    """
    :type words: List[str]
    :rtype: int
    """
    import string

    result=[]
    result=set(result)
    alphabet=list(string.ascii_lowercase)
    cod=[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

    Morse=dict(zip(alphabet,cod))
    count=0
    for x in words:
        content=""
        for i in x:
            if i in Morse.keys():
                content+=Morse[i]
        if content not in result:
            count+=1
            result.add(content)

    return count

words=["gin", "zen", "gig", "msg"]
print(uniqueMorseRepresentations(words))