uniqueMorseRepresentations

Author: masx200

README.md

@@ -2,7 +2,7 @@
 
 #### 介绍
 
-leetcode测试
+leetcode 测试
 
 #### 软件架构
 
@@ -32,6 +32,8 @@ https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array
 
 https://leetcode-cn.com/problems/move-zeroes/
 
+https://leetcode-cn.com/problems/unique-morse-code-words/
+
 #### 安装教程
 
 1. 安装`deno`
@@ -68,7 +70,7 @@ deno task fmt
 deno task lint
 ```
 
-5.使用模块
+5.导入模块
 
 ```ts
 import {} from "https://gitee.com/masx200/leetcode-test/raw/master/mod.ts";
@@ -82,6 +84,28 @@ import {} from "https://github.com/masx200/leetcode-test/raw/master/mod.ts";
 import {} from "https://cdn.jsdelivr.net/gh/masx200/leetcode-test/mod.ts";
 ```
 
+6.使用举例
+
+```ts
+import {
+    ArrayToListNode,
+    climbing_stairs,
+    fei_bo_na_qi_shu_lie_lcof,
+    fibonacci_Number,
+    find_all_numbers_disappeared_in_an_array,
+    html_Entity_Parser,
+    ListNode,
+    ListNodeToArray,
+    merge_Sorted_Array,
+    move_zeros,
+    pow_x_n,
+    que_shi_de_shu_zi_lcof,
+    reverse_Linked_List,
+    two_Sum,
+    unique_morse_code_words,
+} from "./mod.ts";
+```
+
 #### 参与贡献
 
 1. Fork 本仓库

html-entity-parser/test.ts

@@ -1,4 +1,4 @@
-import { assert } from "../deps.ts";
+import { assertEquals } from "../deps.ts";
 import { html_Entity_Parser } from "../mod.ts";
 
 Deno.test("html-entity-parser", () => {
@@ -25,9 +25,7 @@ Deno.test("html-entity-parser", () => {
         },
     ];
 
-    assert(
-        testData.every(
-            ({ input, output }) => html_Entity_Parser(input) === output,
-        ),
-    );
+    testData.forEach(function ({ input, output }) {
+        assertEquals(html_Entity_Parser(input), output);
+    });
 });

mod.ts

@@ -26,3 +26,4 @@ export {
 export { default as que_shi_de_shu_zi_lcof } from "./que-shi-de-shu-zi-lcof/index.ts";
 export { default as find_all_numbers_disappeared_in_an_array } from "./find-all-numbers-disappeared-in-an-array/index.ts";
 export { default as move_zeros } from "./move-zeroes/index.ts";
+export { default as unique_morse_code_words } from "./unique-morse-code-words/index.ts";

reverse-linked-list/test.ts

@@ -1,4 +1,4 @@
-import { assert, equal } from "../deps.ts";
+import { assertEquals } from "../deps.ts";
 import {
     ArrayToListNode,
     ListNodeToArray,
@@ -21,21 +21,14 @@ Deno.test("reverse-linked-list", () => {
         },
     ];
 
-    assert(
-        testData.every(
-            ({ input, output }) =>
-                equal(
-                    ListNodeToArray(
-                        reverse_Linked_List(ArrayToListNode(input)),
-                    ),
-                    output,
-                ) &&
-                equal(
-                    ListNodeToArray(
-                        reverse_Linked_List(ArrayToListNode(output)),
-                    ),
-                    input,
-                ),
-        ),
-    );
+    testData.forEach(function ({ input, output }) {
+        assertEquals(
+            ListNodeToArray(reverse_Linked_List(ArrayToListNode(input))),
+            output,
+        );
+        assertEquals(
+            ListNodeToArray(reverse_Linked_List(ArrayToListNode(output))),
+            input,
+        );
+    });
 });

two-sum/test.ts

@@ -11,9 +11,33 @@ Deno.test("two-sum", () => {
         { input: [[3, 2, 4], 6], output: [1, 2] },
         {
             input: [
-                Array(25)
-                    .fill(0)
-                    .map((_v, i) => i),
+                [
+                    0,
+                    1,
+                    2,
+                    3,
+                    4,
+                    5,
+                    6,
+                    7,
+                    8,
+                    9,
+                    10,
+                    11,
+                    12,
+                    13,
+                    14,
+                    15,
+                    16,
+                    17,
+                    18,
+                    19,
+                    20,
+                    21,
+                    22,
+                    23,
+                    24,
+                ],
                 30,
             ],
             output: [14, 16],

unique-morse-code-words/index.ts

@@ -0,0 +1,48 @@
+export default function uniqueMorseRepresentations(words: string[]): number {
+    const translations = words.map((word) =>
+        Array.from(word)
+            .map((v) => {
+                const m = letterToMorse.get(v);
+
+                if (typeof m === "undefined") {
+                    throw Error("invalid word");
+                }
+                return m;
+            })
+            .join("")
+    );
+
+    const seen = new Set<string>(translations);
+    return seen.size;
+}
+const MORSE = [
+    ".-",
+    "-...",
+    "-.-.",
+    "-..",
+    ".",
+    "..-.",
+    "--.",
+    "....",
+    "..",
+    ".---",
+    "-.-",
+    ".-..",
+    "--",
+    "-.",
+    "---",
+    ".--.",
+    "--.-",
+    ".-.",
+    "...",
+    "-",
+    "..-",
+    "...-",
+    ".--",
+    "-..-",
+    "-.--",
+    "--..",
+];
+const letterToMorse = new Map(
+    MORSE.map((v, i) => [String.fromCharCode(i + "a".charCodeAt(0)), v]),
+);

unique-morse-code-words/test.ts

@@ -0,0 +1,65 @@
+import { assertStrictEquals } from "../deps.ts";
+import { unique_morse_code_words } from "../mod.ts";
+
+Deno.test("unique-morse-code-words", () => {
+    const examples: {
+        input: Parameters<typeof unique_morse_code_words>[0];
+        output: ReturnType<typeof unique_morse_code_words>;
+    }[] = [
+        { input: ["gin", "zen", "gig", "msg"], output: 2 },
+        { input: ["a"], output: 1 },
+        {
+            input: [
+                "saenc",
+                "saenca",
+                "saencb",
+                "saencc",
+                "saencd",
+                "saence",
+                "saencf",
+                "saencg",
+                "saench",
+                "saenci",
+                "effnronmwnj",
+                "effnronmwnk",
+                "effnronmwnl",
+                "effnronmwnm",
+                "effnronmwnn",
+                "effnronmwno",
+                "effnronmwnp",
+                "effnronmwnq",
+                "effnronmwnr",
+                "effnronmwns",
+            ],
+            output: 20,
+        },
+        {
+            input: [
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "saenc",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+                "effnronmwn",
+            ],
+            output: 2,
+        },
+    ];
+    examples.forEach(({ input, output }) => {
+        assertStrictEquals(unique_morse_code_words(input), output);
+    });
+});