[LeetCode]804. 唯一摩尔斯密码词 原创

算法标签 ascii

题目简叙

思路

用ascii和下标解决映射密码关系，然后用set集合来去重即可

代码

class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        vector<string> str={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        
        set<string>strset;
        for(int i=0;i<words.size();i++){
            string tmpstr;
            for(int j=0;j<words[i].size();j++){
                tmpstr+=str[words[i][j]-'a'];
            }
            strset.insert(tmpstr);
            cout<<tmpstr<<endl;
        }

        return strset.size();
    }
};

ac记录