LeetCode 804. Unique Morse Code Words

ZayneHuang

于 2018-07-25 00:38:32 发布

阅读量88

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/github_36324732/article/details/81194859

LeetCode 专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一道LeetCode上的编程题目——独特的摩尔斯密码单词，并提供了一个C++实现的解决方案。通过使用set数据结构来确保摩尔斯密码转换后的字符串唯一性，从而计算出给定单词列表中不同的摩尔斯密码表示的数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题目解析：字符串去重用set即可。

代码如下：0ms Accepted

class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        string morse[26] = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        set <string> S;
        for (auto word : words)
        {
            string s;
            for (auto c : word)
                s += morse[c - 'a'];
            S.insert(s);
        }
        return S.size();
    }
};