这是来自Leetcode 804的题目:唯一摩尔斯密码词。我想知道为什么我的代码得到了正确的摩尔斯码,但它按字母顺序排序,这并不是我的本意。感谢任何帮助。
输入:
输入:
words = ["gin", "zen", "gig", "msg"]
代码:
class Solution:
def uniqueMorseRepresentations(self, words: List[str]) -> int:
morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
alphabet = ['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']
transformation = []
zip_ = list(zip(morse, alphabet))
for word in words:
transformation.append(''.join(code[0] for code in zip_ for letter in word if letter in code[1]))
输出:
['--...-.', '.-.--..', '--.--...', '--.--...']