本文介绍了如何用Python实现LeetCode中的一道题目——独特摩尔斯代码单词。作者通过创建一个字典将字母映射到摩尔斯代码，然后遍历输入的单词列表，将每个单词转换为摩尔斯代码并加入结果集中。最后返回结果集的大小，即独特的摩尔斯代码单词数量。
文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
1. Description
2. Solution
- Version 1
class Solution:
def uniqueMorseRepresentations(self, words: List[str]) -> int:
az = [chr(x) for x in range(ord('a'), ord('z') + 1)]
morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
mapping = {}
for i in range(len(morse)):
mapping[az[i]] = morse[i]
result = set()
for word in words:
temp = ''
for ch in word:
temp = temp + mapping[ch]
result.add(temp)
return len(result)
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
