804-唯一福尔摩斯密码
国际摩尔斯密码定义一种标准编码方式,将每个字母对应于一个由一系列点和短线组成的字符串, 比如: "a" 对应 ".-", "b" 对应 "-...", "c" 对应 "-.-.", 等等。
为了方便,所有26个英文字母对应摩尔斯密码表如下:
[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
给定一个单词列表,每个单词可以写成每个字母对应摩尔斯密码的组合。例如,"cab" 可以写成 "-.-..--...",(即 "-.-." + "-..." + ".-"字符串的结合)。我们将这样一个连接过程称作单词翻译。
返回我们可以获得所有词不同单词翻译的数量。
例如:
输入: words = ["gin", "zen", "gig", "msg"]
输出: 2
解释:
各单词翻译如下:
"gin" -> "--...-."
"zen" -> "--...-."
"gig" -> "--...--."
"msg" -> "--...--."
共有 2 种不同翻译, "--...-." 和 "--...--.".
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/unique-morse-code-words
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法一:
根据所给密码列表生成相应的a-z的字典,循环words列表,把每一个单词加密后存入字典,以密文为key,这样就利用字典实现了去重功能,最后返回字典中的个数
class Solution:
def uniqueMorseRepresentations(self, words):
#生成字典
li = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
dict = {}
for i in range(len(li)):
dict[chr(ord('a')+i)] = li[i]
#初始化一个字典
words_dict = {}
#遍历单词表
for i in words:
s_temp = ''
for j in i:
s_temp+=dict[j]
words_dict[s_temp] = 0 #这里赋值为什么都无所谓,主要是为了字典的去重
return len(words_dict)
方法二:
主体思想与方法一一致,只是在去重时,使用了set()集合
class Solution:
def uniqueMorseRepresentations(self, words):
li = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
dict = {}
for i in range(len(li)):
dict[chr(ord('a')+i)] = li[i]
words_list = []
for i in words:
s_temp = ''
for j in i:
s_temp+=dict[j]
words_list.append(s_temp)
return len(set(words_list))
总结:
1.在循环生成dict时,用到了ord()和chr()函数,查看后ord()的作用是返回字符串中字符的unicode编码值,而chr()的作用则是把unicode编码重新转换成字符串。
2.关于字典的去重,可以利用字典本身去重,如一个字典要根据他的value进行去重,遍历它,然后以它的value作为另一个新字典的key存入进去,实现去重
3.去重还可以转换为列表,然后再转换为set()集合进行去重