Class Solution

LeetCode_problems/UniqueMorseCode/solution.cpp:15–42

class Solution {
private:
    char *alphabet_morse[26] = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        vector<string> morse_answers;
        vector<string> answer;
        int i = 0;
        for(int i=0; i<words.size(); i++){
            answer = {};
            for(int j=0; j<words[i].size(); j++)
                answer.push_back(alphabet_morse[int(words[i][j]) - 97]);
            
            char morse[50] = "\0";
            int k = 0;
            for(int i=0; i<answer.size() ;i++)
                for(int j=0; answer[i][j]!='\0'; j++){
                    morse[k] = answer[i][j];
                    k++;
                }
            morse[k] = '\0';
            morse_answers.push_back(morse);
        }
        std::sort(morse_answers.begin(), morse_answers.end());
        int uniqueCount = std::unique(morse_answers.begin(), morse_answers.end()) - morse_answers.begin();
        return uniqueCount;
    }
};