Leetcode笔记 每日一题 804. 唯一摩尔斯密码词 (22.04.10)
Leetcode 每日一题 804. 唯一摩尔斯密码词 (22.04.10)
题目
国际摩尔斯密码定义一种标准编码方式,将每个字母对应于一个由一系列点和短线组成的字符串, 比如:
'a'
对应".-"
,'b'
对应"-..."
,'c'
对应"-.-."
,以此类推。
为了方便,所有 26 个英文字母的摩尔斯密码表如下:
[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
给你一个字符串数组 words ,每个单词可以写成每个字母对应摩尔斯密码的组合。
- 例如,“cab” 可以写成
"-.-..--..."
,(即"-.-." + ".-" + "-..."
字符串的结合)。我们将这样一个连接过程称作 单词翻译 。
对 words 中所有单词进行单词翻译,返回不同 单词翻译 的数量。
示例 1:
输入: words = [“gin”, “zen”, “gig”, “msg”]
输出: 2
解释: 各单词翻译如下:
“gin” ->“–…-.”
“zen” -> “–…-.”
“gig” -> “–…–.”
“msg” -> “–…–.”共有 2 种不同翻译, “–…-.” 和 “–…–.”.
示例 2:
输入:words = [“a”]
输出:1
提示:
- 1 <= words.length <= 100
- 1 <= words[i].length <= 12
- words[i] 由小写英文字母组成
解题思路
1. 因为题目直接给了26个字母的摩尔斯密码,所以直接套用
MORSE_CODE = []
2. 将words转换摩尔斯密码,可以成利用ASCII 编码对字母进行运算求出每个字母在MORSE_CODE[]
里对应的摩尔斯密码,并存放进set()创建的集合中。比如:
'a':MORSE_CODE[ord(’a') - ord('a')] = MORSE_CODE[0] = ".-"
'z':MORSE_CODE[ord('z') - ord('a')] = MORSE_CODE[25] = "--.."
3. 最后输出
len()
长度,即不同单词翻译的数量
Python代码
class Solution:
def uniqueMorseRepresentations(self, words: List[str]) -> int:
MORSE_CODE = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
res = set() # 建立一个集合存放words转换成摩尔斯密码的结果
for word in words:
morse = ''
for w in word:
morse += MORSE_CODE[ord(w) - ord('a')] # 对每个字母进行换算
res.add(morse) # 存放结果
return len(res) # 不同单词翻译的数量
简便算法
class Solution:
def uniqueMorseRepresentations(self, words: List[str]) -> int:
return len({''.join(MORSE_CODE[ord(w) - ord('a')] for w in word) for word in words})
运行结果相差不大: