class Solution:
def uniqueMorseRepresentations(self, words):
"""
:type words: List[str]
:rtype: int
"""
dic = {"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":"--.."}
morse=''
morse_list = []
mor_list = []
diff_morse=0
for word in words:
word = word.lower()
for i in word:
morse += dic[i]
morse_list.append(morse)
morse = ''
for mor in morse_list:
if mor not in mor_list:
mor_list.append(mor)
diff_morse += 1
return diff_morse
leetcode - 804 - 唯一摩尔斯密码词
最新推荐文章于 2022-04-10 08:56:00 发布
本文介绍了一种算法,用于将英文单词转换为Morse电码,并计算不同单词转换后的独特Morse电码数量。通过建立英文字母到Morse电码的映射,该算法能有效地区分和计数各种输入单词的独特电码表示。
254

被折叠的 条评论
为什么被折叠?



