https://leetcode.cn/problems/shortest-word-distance-iii/

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/shortest-word-distance-iii/
+
 https://leetcode.cn/problems/shortest-word-distance-ii/
 
 https://leetcode.cn/problems/shortest-word-distance/

shortest-word-distance-iii/index.ts

@@ -0,0 +1,31 @@
+export default function shortestDistance(
+    words: string[],
+    word1: string,
+    word2: string,
+): number {
+    let posA = -1;
+    let posB = -1;
+    let minDistance = Infinity;
+
+    for (let i = 0; i < words.length; i++) {
+        const word = words[i];
+
+        if (word === (word1)) {
+            posA = i;
+        } else if (word === (word2)) {
+            posB = i; // this is covering normal cases, word1 not same as word2
+        }
+
+        if (posA != -1 && posB != -1 && posA != posB) { // @note: update before reset posB
+            minDistance = Math.min(minDistance, Math.abs(posA - posB));
+        }
+
+        if (word1 === (word2)) {
+            // always updating posA in above line, so after checking update posB
+            // so that, posB is always the most recent word's index
+            posB = posA;
+        }
+    }
+
+    return minDistance;
+}

shortest-word-distance-iii/test.ts

@@ -0,0 +1,16 @@
+import { assertEquals } from "asserts";
+import shortestDistance from "./index.ts";
+
+Deno.test("shortest-word-distance", () => {
+    const words = ["practice", "makes", "perfect", "coding", "makes"];
+
+    const word1 = "coding",
+        word2 = "makes";
+    assertEquals(1, shortestDistance(words, word1, word2));
+});
+Deno.test("shortest-word-distance", () => {
+    const words = ["practice", "makes", "perfect", "coding", "makes"];
+
+    const word1 = "makes", word2 = "makes";
+    assertEquals(3, shortestDistance(words, word1, word2));
+});