804. 唯一摩尔斯密码词

原创于 2019-07-25 23:17:11 发布 · 138 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一个使用C++实现的Morse代码转换算法，该算法将一系列英文单词转换为对应的Morse代码，并计算不同Morse代码表示的数量。通过创建一个Solution类，我们定义了uniqueMorseRepresentations函数，它接收一个字符串向量作为输入，返回唯一Morse代码表示的数量。

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

class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        if(words.size() == 0)  return 0;
        string s[26]={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        string code[words.size()];
        for(int i = 0; i < words.size(); i++){
            code[i] = "";
            for(int j = 0; j < words[i].length(); j++){
                code[i] = code[i] + s[words[i][j] - 'a']; 
            }
        }
        int count = 0;
        for(int i = 0; i < words.size(); i++){
            bool find = false;
            for(int j = i + 1; j < words.size(); j++){
                if(code[i] == code[j])
                {
                    find = true;
                    break;
                }
            }
            if(find)
                continue;
            count++;
        }
        return count;
    }
};

在这里插入图片描述