leetcode 804. Unique Morse Code Words

最新推荐文章于 2024-09-14 18:52:56 发布

Invisible Name

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量205

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/WIMPs_L/article/details/124078958

版权

摩尔斯电码字符串处理哈希表编码转换算法

关键词由CSDN通过智能技术生成

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

Constraints:

1 <= words.length <= 100
1 <= words[i].length <= 12
words[i] consists of lowercase English letters.

class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        vector<string> table = { ".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.." };
        string w = "";
        vector<string> trans = {};
        bool find = false;
        for (string x : words) {
            w=""; //修改初始
            for (char i:x) {
                w += table[i - 'a']; //char类型可以这样做，不会冲突
            }
            find=false; //修改初始
            for (string y : trans) {
                if (y == w) {
                    find = true;
                    break;
                }
            }
            if(!find)
                trans.push_back(w);
                
        }
        return trans.size();
    }
};