feat: add typescript solution to lc problem: No.0290.Word Pattern (doocs#582)

Author: zhaocchen

solution/0200-0299/0290.Word Pattern/README.md

@@ -92,6 +92,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function wordPattern(pattern: string, s: string): boolean {
+    let n = pattern.length;
+    let values = s.split(' ');
+    if (n != values.length) return false;
+    let table = new Array(128);
+    for (let i = 0; i < n; i++) {
+        let k = pattern.charCodeAt(i), v = values[i];
+        if (!table[k]) {
+            if (table.includes(v)) return false;
+            table[k] = v;
+        } else {
+            if (table[k] != v) return false;
+        }
+    }
+    return true;
+};
+```
+
 ### **...**
 
 ```

solution/0200-0299/0290.Word Pattern/README_EN.md

@@ -102,6 +102,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function wordPattern(pattern: string, s: string): boolean {
+    let n = pattern.length;
+    let values = s.split(' ');
+    if (n != values.length) return false;
+    let table = new Array(128);
+    for (let i = 0; i < n; i++) {
+        let k = pattern.charCodeAt(i), v = values[i];
+        if (!table[k]) {
+            if (table.includes(v)) return false;
+            table[k] = v;
+        } else {
+            if (table[k] != v) return false;
+        }
+    }
+    return true;
+};
+```
+
 ### **...**
 
 ```

solution/0200-0299/0290.Word Pattern/Solution.ts

@@ -0,0 +1,16 @@
+function wordPattern(pattern: string, s: string): boolean {
+    let n = pattern.length;
+    let values = s.split(' ');
+    if (n != values.length) return false;
+    let table = new Array(128);
+    for (let i = 0; i < n; i++) {
+        let k = pattern.charCodeAt(i), v = values[i];
+        if (!table[k]) {
+            if (table.includes(v)) return false;
+            table[k] = v;
+        } else {
+            if (table[k] != v) return false;
+        }
+    }
+    return true;
+};