804. Unique Morse Code Words

这道题稍微打败了85%有点小感动，emmm还是非常简单 让我再一次熟悉map
直接贴代码了，没有什么可说的

  int uniqueMorseRepresentations(vector<string>& words) {
        string code[] = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        int size_of_v = words.size();
        int different = 0;
        map<string,int> code_map;
        for(int i = 0; i < size_of_v ; i++){
            //用于保存vector中code字符串，用map 看是否出现过，没出现 就different++
            string ini = "";
            int size_of_str = words[i].size();
            for(int j = 0 ; j < size_of_str ; j++)
                ini += code[words[i][j]-'a'];
            
            if(code_map.find(ini) == code_map.end()){
                code_map[ini] = 1;
                different ++;
            }
                
        }
        return different;
}