leetcode 804. Unique Morse Code Words

原创于 2019-04-07 15:20:09 发布 · 85 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一种使用C++实现的独特摩尔斯电码转换器。该程序通过将输入的单词转换为对应的摩尔斯电码表示，并计算不同单词转换后的唯一摩尔斯电码数量。通过这种方式，可以有效地识别和区分不同的单词。

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

#include<set>
class Solution {
public:
    string code[26]={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
    int uniqueMorseRepresentations(vector<string>& words) {
        int l = words.size();
        set<string> de;
        for(int i =0;i<l;i++)
        {
            string tmp;
           for(int j=0;j<words[i].length();j++)
           {
               tmp += code[words[i][j]-'a'];
           }
            if(de.find(tmp)!=de.end())continue;
            else de.insert(tmp);
        }
        return de.size();
    }
};