https://leetcode.cn/problems/replace-words/

Author: masx200

README.md

@@ -886,6 +886,8 @@ https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed/
 
 https://leetcode.cn/problems/find-median-from-data-stream/
 
+https://leetcode.cn/problems/replace-words/
+
 #### 安装教程
 
 1. 安装`deno`

design-add-and-search-words-data-structure/PrefixTreeInsert.ts

@@ -4,17 +4,21 @@ export function PrefixTreeInsert<T extends PrefixTree>(
     root: T,
     word: string,
     {
+        stop,
         end,
         each,
         create = () => PrefixTree() as T,
     }: {
+        stop?: (node: T) => boolean;
         each?: (node: T) => void;
         create?: () => T;
         end?: (node: T) => void;
     } = {},
 ): void {
     if (word.length === 0) return;
+
     each?.(root);
+    if (stop?.(root)) return;
     let node = root;
     for (const ch of word) {
         const next: T = (node.children.get(ch) ??
@@ -23,7 +27,9 @@ export function PrefixTreeInsert<T extends PrefixTree>(
                 node.children.set(ch, next);
                 return next;
             })()) as T;
+
         each?.(next);
+        if (stop?.(next)) return;
         node = next;
     }
     node.isEnd = true;

implement-trie-prefix-tree/PrefixTreeSearchPrefix.ts

@@ -5,22 +5,28 @@ export function PrefixTreeSearchPrefix<T extends PrefixTree | TrieNode>(
     root: T,
     prefix: string,
     {
+        stop,
         end,
         each,
     }: {
+        stop?: (node: T) => boolean;
         each?: (node: T) => void;
 
         end?: (node: T) => void;
     } = {},
 ): T | undefined {
     let node = root;
+
     each?.(root);
+    if (stop?.(root)) return root;
     for (const ch of prefix) {
         const next: T = node.children.get(ch) as T;
         if (!next) {
             return;
         }
+
         each?.(next);
+        if (stop?.(next)) return next;
         node = next;
     }
     end?.(node);

replace-words/index.ts

@@ -0,0 +1,30 @@
+import { PrefixTree } from "../implement-trie-prefix-tree/PrefixTree.ts";
+import { PrefixTreeInsert, PrefixTreeSearchPrefix } from "../mod.ts";
+export default function replaceWords(
+    dictionary: string[],
+    sentence: string,
+): string {
+    const root = PrefixTree();
+    dictionary.forEach((word) =>
+        PrefixTreeInsert(root, word, {
+            stop: (node) => node.isEnd,
+        })
+    );
+
+    const words = sentence.split(" ");
+    return words
+        .map((word) => {
+            let index = -1;
+            const node = PrefixTreeSearchPrefix(root, word, {
+                stop: (node) => node.isEnd,
+                each() {
+                    index++;
+                },
+            });
+            if (!node) {
+                return word;
+            }
+            return word.slice(0, index);
+        })
+        .join(" ");
+}

replace-words/test.ts

@@ -0,0 +1,14 @@
+import { assertEquals } from "../deps.ts";
+import replaceWords from "./index.ts";
+
+Deno.test("replace-words", () => {
+    const dictionary = ["cat", "bat", "rat"];
+    const sentence = "the cattle was rattled by the battery";
+    const result = replaceWords(dictionary, sentence);
+    assertEquals(result, "the cat was rat by the bat");
+
+    assertEquals(
+        "a a b c",
+        replaceWords(["a", "b", "c"], "aadsfasf absbs bbab cadsfafs"),
+    );
+});