LeetCode：804. Unique Morse Code Words

关注

原创最新推荐文章于 2026-01-28 09:44:45 发布 385 阅读 AI 写同款· GEO 优化 ›

高斯-约当（Gauss-Jordan）消元法——c++代码实现具体算法的详细原理请参照此篇博客：高斯-约当（Gauss-Jordan）消元法下面是具体c++代码，不保证程序最优化，提供一个可行的程序，供大家改进，同时感谢大家提意见。——大神勿喷呀，我是一个小菜鸟~void Guss_Jordan(int n,double *a)//阶数n 系数矩阵a { double*a_temp = new double[n*n * 2];//a与单位矩阵的组合阅读详情

链接：
https://leetcode.com/problems/unique-morse-code-words/description/

题目：
International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: “a” maps to “.-“, “b” maps to “-…”, “c” maps to “-.-.”, and so on.

For convenience, the full table for the 26 letters of the English alphabet is given below:

[“.-“,”-…”,”-.-.”,”-..”,”.”,”..-.”,”–.”,”….”,”..”,”.—”,”-.-“,”.-..”,”–”,”-.”,”—”,”.–.”,”–.-“,”.-.”,”…”,”-“,”..-“,”…-“,”.–”,”-..-“,”-.–”,”–..”]
Now, given a list of words, each word can be written as a concatenation of the Morse code of each letter. For example, “cab” can be written as “-.-.-….-“, (which is the concatenation “-.-.” + “-…” + “.-“). We’ll call such a concatenation, the transformation of a word.

Return the number of different transformations among all words we have.

Example:
Input: words = [“gin”, “zen”, “gig”, “msg”]
Output: 2
Explanation:
The transformation of each word is:
“gin” -> “–…-.”
“zen” -> “–…-.”
“gig” -> “–…–.”
“msg” -> “–…–.”

There are 2 different transformations, “–…-.” and “–…–.”.

Note:

The length of words will be at most 100.
Each words[i] will have length in range [1, 12].
words[i] will only consist of lowercase letters.

思路：
set运用，ord简化解题
这里写图片描述

class Solution:
    def __init__(self):
        self.table = [".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--",
                 "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."]
        self.alpha = ['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']
    def uniqueMorseRepresentations(self, words):
        """
        :type words: List[str]
        :rtype: int
        """
        morse_code_set = set()
        for word in words:
            morse_code = ''
            for alpha in word:
                idx = self.alpha.index(alpha)
                morse_code += self.table[idx]
            morse_code_set.add(morse_code)
        return len(morse_code_set)

或者

class Solution:
    def __init__(self):
        self.table = [".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--",
                 "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."]
    def uniqueMorseRepresentations(self, words):
        """
        :type words: List[str]
        :rtype: int
        """
        morse_code_set = set()
        for word in words:
            morse_code = ''
            for alpha in word:
                morse_code += self.table[ord(alpha) - ord('a')]
            morse_code_set.add(morse_code)
        return len(morse_code_set)