Description
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.
Solution:
C++ 中set的用法详解 (待学)
https://blog.csdn.net/yas12345678/article/details/52601454
#include<string>
#include<iostream>
#include<vector>
#include<set>
using namespace std;
class Solution {
public:
int uniqueMorseRepresentations(vector<string>&words) {
string morse[]= { ".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.." };
set<string> res;
for (int i = 0; i < words.size(); i++)
{
string tmp = "";
string cur = words[i];
for (int j = 0; j < cur.length(); j++)
{
tmp += morse[cur[j] - 'a'];
}
res.insert(tmp);
}
return res.size();
}
};
int main()
{
vector<string> input = { "gin", "zen", "gig", "msg" };
Solution cc;
int result;
result = cc.uniqueMorseRepresentations(input);
cout << result << endl;
system("pause");
return 0;
}