[LeetCode Sync] Runtime - 0 ms (100.00%), Memory - 17.8 MB (37.15%)

Author: NinePiece2

Solutions/0822-unique-morse-code-words/README.md

@@ -0,0 +1,50 @@
+<p>International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:</p>
+
+<ul>
+	<li><code>&#39;a&#39;</code> maps to <code>&quot;.-&quot;</code>,</li>
+	<li><code>&#39;b&#39;</code> maps to <code>&quot;-...&quot;</code>,</li>
+	<li><code>&#39;c&#39;</code> maps to <code>&quot;-.-.&quot;</code>, and so on.</li>
+</ul>
+
+<p>For convenience, the full table for the <code>26</code> letters of the English alphabet is given below:</p>
+
+<pre>
+[&quot;.-&quot;,&quot;-...&quot;,&quot;-.-.&quot;,&quot;-..&quot;,&quot;.&quot;,&quot;..-.&quot;,&quot;--.&quot;,&quot;....&quot;,&quot;..&quot;,&quot;.---&quot;,&quot;-.-&quot;,&quot;.-..&quot;,&quot;--&quot;,&quot;-.&quot;,&quot;---&quot;,&quot;.--.&quot;,&quot;--.-&quot;,&quot;.-.&quot;,&quot;...&quot;,&quot;-&quot;,&quot;..-&quot;,&quot;...-&quot;,&quot;.--&quot;,&quot;-..-&quot;,&quot;-.--&quot;,&quot;--..&quot;]</pre>
+
+<p>Given an array of strings <code>words</code> where each word can be written as a concatenation of the Morse code of each letter.</p>
+
+<ul>
+	<li>For example, <code>&quot;cab&quot;</code> can be written as <code>&quot;-.-..--...&quot;</code>, which is the concatenation of <code>&quot;-.-.&quot;</code>, <code>&quot;.-&quot;</code>, and <code>&quot;-...&quot;</code>. We will call such a concatenation the <strong>transformation</strong> of a word.</li>
+</ul>
+
+<p>Return <em>the number of different <strong>transformations</strong> among all words we have</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> words = [&quot;gin&quot;,&quot;zen&quot;,&quot;gig&quot;,&quot;msg&quot;]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The transformation of each word is:
+&quot;gin&quot; -&gt; &quot;--...-.&quot;
+&quot;zen&quot; -&gt; &quot;--...-.&quot;
+&quot;gig&quot; -&gt; &quot;--...--.&quot;
+&quot;msg&quot; -&gt; &quot;--...--.&quot;
+There are 2 different transformations: &quot;--...-.&quot; and &quot;--...--.&quot;.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> words = [&quot;a&quot;]
+<strong>Output:</strong> 1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= words.length &lt;= 100</code></li>
+	<li><code>1 &lt;= words[i].length &lt;= 12</code></li>
+	<li><code>words[i]</code> consists of lowercase English letters.</li>
+</ul>

Solutions/0822-unique-morse-code-words/solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def uniqueMorseRepresentations(self, words: List[str]) -> int:
+        morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---",
+                    "-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-",
+                    "..-","...-",".--","-..-","-.--","--.."]
+        # morse_set = set()
+        # for word in words:
+        #     morse_code = ""
+        #     for char in word:
+        #         morse_code += morse[ord(char) - ord('a')]
+        #     if morse_code not in morse_set:
+        #         morse_set.add(morse_code)
+
+        # return len(morse_set)
+        morse_set = {"".join([morse[ord(char) - ord('a')] for char in word]) for word in words}
+        return len(morse_set)