Leetcode 804.唯一摩尔斯密码

最新推荐文章于 2024-08-30 11:06:53 发布

cwtnice

最新推荐文章于 2024-08-30 11:06:53 发布

阅读量400

点赞数

分类专栏：每日一题文章标签： leetcode 哈希表

本文链接：https://blog.csdn.net/cwtnice/article/details/124100496

版权

每日一题专栏收录该内容

118 篇文章 2 订阅

订阅专栏

该博客介绍了如何利用哈希表解决LeetCode中的804题，即计算给定单词列表中不同摩尔斯电码编码的个数。博主首先解释了摩尔斯电码的映射规则，然后展示了如何通过遍历每个单词并将其转换为摩尔斯电码，再插入哈希表来实现去重。最终，返回哈希表的大小作为答案。博客内容涵盖了C++代码实现和时间复杂度分析，其中时间复杂度和空间复杂度都为O(S)，S表示所有单词的长度之和。

摘要由CSDN通过智能技术生成

原题链接: Leetcode 804. Unique Morse Code Words

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:

[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

Given an array of strings words where 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 of “-.-.”, “.-”, and “-…”. We will call such a concatenation the transformation of a word.
Return the number of different transformations among all words we have.

Example 1:

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 "--...--.".

Example 2:

Input: words = ["a"]
Output: 1

方法一：哈希表

思路：

题目问的就是给定一些单词，问他们的摩尔斯编码去重后还有多少种。
哈希表unordered_set可以自动实现去重，只要将单词转化后插入，最后输出哈希表的大小即可

c++代码：

const static string a[] = {
        ".-", "-...", "-.-.", "-..", ".", "..-.", "--.",
        "....", "..", ".---", "-.-", ".-..", "--", "-.",
        "---", ".--.", "--.-", ".-.", "...", "-", "..-",
        "...-", ".--", "-..-", "-.--", "--.."
};

class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        unordered_set<string> s;

        for(auto w : words){
            string ans;
            for(auto c : w){
                ans += a[c - 'a'];
            }
            s.insert(ans);
        }
        return s.size();
    }
};