804. Unique Morse Code Words

static int wing=[]()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();

class Solution 
{
public:
    int uniqueMorseRepresentations(vector<string>& words) 
    {
        unordered_map<char,string> csmap={{'a',".-"},{'b',"-..."},{'c',"-.-."},{'d',"-.."},{'e',"."},{'f',"..-."},{'g',"--."},{'h',"...."},{'i',".."},{'j',".---"},{'k',"-.-"},{'l',".-.."},{'m',"--"},{'n',"-."},{'o',"---"},{'p',".--."},{'q',"--.-"},{'r',".-."},{'s',"..."},{'t',"-"},{'u',"..-"},{'v',"...-"},{'w',".--"},{'x',"-..-"},{'y',"-.--"},{'z',"--.."}};
        unordered_set<string> judge;
        for(string &s:words)
        {
            string cur;
            for(char &c:s)
            {
                cur=cur+csmap[c];
            }
            judge.insert(cur);
        }
        int res=judge.size();
        return res;
    }
};

一个map和一个set搞定，问题不大