Unique Morse Code Words Problem


Description

LeetCode Problem 804.

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:

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

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:

1
2
3
4
5
6
7
8
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:

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

Constraints:

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


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        vector<string> morse_code = { ".-", "-...", "-.-.", "-..", ".",
        	"..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--",
        	"-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-",
        	"...-", ".--", "-..-", "-.--", "--.." };
        unordered_set<string> gen_codes;

        for (auto word : words) {
            string code = "";
            for (auto ch : word)
                code += morse_code[ch - 'a'];
            gen_codes.insert(code);
        }

        return gen_codes.size();
    }
};




Related Posts

X Of A Kind In A Deck Of Cards Problem

LeetCode 914. In a deck of cards, each card has...

Word Subsets Problem

LeetCode 916. You are given two string arrays words1 and...

Vowel Spellchecker Problem

LeetCode 966. Given a wordlist, we want to implement a...

Verifying An Alien Dictionary Problem

LeetCode 953. In an alien language, surprisingly, they also use...

Unique Morse Code Words Problem

LeetCode 804. International Morse Code defines a standard encoding where...

Unique Email Addresses Problem

LeetCode 929. Every valid email consists of a local name...