feat: add typescript solution to lc problem: No.0438

No.0438.Find All Anagrams in a String

Author: zhaocchen

solution/0400-0499/0438.Find All Anagrams in a String/README.md

@@ -139,6 +139,31 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findAnagrams(s: string, p: string): number[] {
+    let n = s.length, m = p.length;
+    let cnt = new Array(26).fill(0);
+    let ans = [];
+    for (let i = 0; i < m; i++) {
+        cnt[p.charCodeAt(i) - 97]--;
+        cnt[s.charCodeAt(i) - 97]++;
+    }
+    if (cnt.every(v => v == 0)) {
+        ans.push(0);
+    }
+    for (let i = m; i < n; i++) {
+        cnt[s.charCodeAt(i) - 97]++;
+        cnt[s.charCodeAt(i - m) - 97]--;
+        if (cnt.every(v => v == 0)) {
+            ans.push(i - m + 1);
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0400-0499/0438.Find All Anagrams in a String/README_EN.md

@@ -89,6 +89,31 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findAnagrams(s: string, p: string): number[] {
+    let n = s.length, m = p.length;
+    let cnt = new Array(26).fill(0);
+    let ans = [];
+    for (let i = 0; i < m; i++) {
+        cnt[p.charCodeAt(i) - 97]--;
+        cnt[s.charCodeAt(i) - 97]++;
+    }
+    if (cnt.every(v => v == 0)) {
+        ans.push(0);
+    }
+    for (let i = m; i < n; i++) {
+        cnt[s.charCodeAt(i) - 97]++;
+        cnt[s.charCodeAt(i - m) - 97]--;
+        if (cnt.every(v => v == 0)) {
+            ans.push(i - m + 1);
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0400-0499/0438.Find All Anagrams in a String/Solution.ts

@@ -0,0 +1,20 @@
+function findAnagrams(s: string, p: string): number[] {
+    let n = s.length, m = p.length;
+    let cnt = new Array(26).fill(0);
+    let ans = [];
+    for (let i = 0; i < m; i++) {
+        cnt[p.charCodeAt(i) - 97]--;
+        cnt[s.charCodeAt(i) - 97]++;
+    }
+    if (cnt.every(v => v == 0)) {
+        ans.push(0);
+    }
+    for (let i = m; i < n; i++) {
+        cnt[s.charCodeAt(i) - 97]++;
+        cnt[s.charCodeAt(i - m) - 97]--;
+        if (cnt.every(v => v == 0)) {
+            ans.push(i - m + 1);
+        }
+    }
+    return ans;
+};