Runtime: 3 ms (Top 85.58%) | Memory: 8.5 MB (Top 62.02%)

Author: AnasImloul

scripts/algorithms/U/Unique Morse Code Words/Unique Morse Code Words.cpp

@@ -1,30 +1,28 @@
+// Runtime: 3 ms (Top 85.58%) | Memory: 8.5 MB (Top 62.02%)
 class Solution {
 public:
-  
+
   string convert(string st)
   {
      string s1[]={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
     string s="";
     for(char a:st)
     {
       s+=s1[a - 'a'];
-      
+
     }
     return s;
-    
+
   }
     int uniqueMorseRepresentations(vector<string>& words) {
-      
-     set<string>st; 
+
+     set<string>st;
       for(int i=0;i<words.size();i++)
       {
       st.insert(convert(words[i]));
-      
-               
-      
+
       }
-      
-      
+
       return st.size();
     }
-};
+};