feat: add ts solution to lcci problem: No.17.11

No.17.11.Find Closest

Author: YangFong

lcci/17.11.Find Closest/README.md

@@ -40,6 +40,27 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function findClosest(words: string[], word1: string, word2: string): number {
+    let index1 = 100000;
+    let index2 = -100000;
+    let res = 100000;
+    const n = words.length;
+    for (let i = 0; i < n; i++) {
+        const word = words[i];
+        if (word === word1) {
+            index1 = i;
+        } else if (word === word2) {
+            index2 = i;
+        }
+        res = Math.min(res, Math.abs(index1 - index2));
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

lcci/17.11.Find Closest/README_EN.md

@@ -36,6 +36,27 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function findClosest(words: string[], word1: string, word2: string): number {
+    let index1 = 100000;
+    let index2 = -100000;
+    let res = 100000;
+    const n = words.length;
+    for (let i = 0; i < n; i++) {
+        const word = words[i];
+        if (word === word1) {
+            index1 = i;
+        } else if (word === word2) {
+            index2 = i;
+        }
+        res = Math.min(res, Math.abs(index1 - index2));
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

lcci/17.11.Find Closest/Solution.ts

@@ -0,0 +1,16 @@
+function findClosest(words: string[], word1: string, word2: string): number {
+    let index1 = 100000;
+    let index2 = -100000;
+    let res = 100000;
+    const n = words.length;
+    for (let i = 0; i < n; i++) {
+        const word = words[i];
+        if (word === word1) {
+            index1 = i;
+        } else if (word === word2) {
+            index2 = i;
+        }
+        res = Math.min(res, Math.abs(index1 - index2));
+    }
+    return res;
+}