804. Unique Morse Code Words
阿新 • • 發佈:2018-07-28
nbsp concat stand xpl ring sent lis code auto
題目描述:
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:
[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
Now, given a list of words, 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 "-.-." + "-..." + ".-"). We‘ll call such a concatenation, the transformation of a word.
Return the number of different transformations among all words we have.
Example: 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 "--...--.".
Note:
- The length of
words
will be at most100
- Each
words[i]
will have length in range[1, 12]
. words[i]
will only consist of lowercase letters.
解題思路:
題目簡單,直接上代碼。
代碼:
1 class Solution { 2 public: 3 int uniqueMorseRepresentations(vector<string>& words) { 4 set<string> concatenations; 5 for (int i = 0; i < words.size(); ++i) { 6 string tmp = words[i]; 7 string concatenation; 8 for (auto c : tmp) { 9 char cha = tolower(c); 10 concatenation += tokens[cha-‘a‘]; 11 } 12 concatenations.insert(concatenation); 13 } 14 return concatenations.size(); 15 } 16 static const vector<string> tokens; 17 }; 18 19 const vector<string> Solution::tokens = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
804. Unique Morse Code Words