-
Notifications
You must be signed in to change notification settings - Fork 0
/
804. Unique Morse Code Words.py
41 lines (38 loc) · 1.24 KB
/
804. Unique Morse Code Words.py
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
class Solution:
def uniqueMorseRepresentations(self, words: List[str]) -> int:
hash_map = {"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":"--.."
}
transformation = []
output = 0
for word in words:
new_string = ""
for i in range(len(word)):
new_string += hash_map[word[i]]
if new_string not in transformation:
transformation.append(new_string)
return len(transformation)