leetcode - 804 - 唯一摩尔斯密码词

最新推荐文章于 2022-04-10 20:02:17 发布

hustwayne

最新推荐文章于 2022-04-10 20:02:17 发布

阅读量225

点赞数

分类专栏： leetcode for python

本文链接：https://blog.csdn.net/hustwayne/article/details/83545094

版权

leetcode for python 专栏收录该内容

63 篇文章 1 订阅

订阅专栏

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