feat: add solutions to lc problem: No.1002 (doocs#948)

Author: thinkasany

solution/1000-1099/1002.Find Common Characters/README.md

@@ -155,4 +155,34 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function commonChars(words: string[]): string[] {
+    const freq: number[] = new Array(26).fill(10000);
+    for (const word of words) {
+        const t: number[] = new Array(26).fill(0);
+        for (const c of word.split('')) {
+            ++t[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+        }
+        for (let i = 0; i < 26; ++i) {
+            freq[i] = Math.min(freq[i], t[i]);
+        }
+    }
+    const res: string[] = [];
+    for (let i = 0; i < 26; ++i) {
+        while (freq[i]-- > 0) {
+            res.push(String.fromCharCode(i + 'a'.charCodeAt(0)));
+        }
+    }
+    return res;
+}
+```
+
+### **...**
+
+```
+
+```
+
 <!-- tabs:end -->

solution/1000-1099/1002.Find Common Characters/README_EN.md

@@ -132,6 +132,30 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function commonChars(words: string[]): string[] {
+    const freq: number[] = new Array(26).fill(10000);
+    for (const word of words) {
+        const t: number[] = new Array(26).fill(0);
+        for (const c of word.split('')) {
+            ++t[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+        }
+        for (let i = 0; i < 26; ++i) {
+            freq[i] = Math.min(freq[i], t[i]);
+        }
+    }
+    const res: string[] = [];
+    for (let i = 0; i < 26; ++i) {
+        while (freq[i]-- > 0) {
+            res.push(String.fromCharCode(i + 'a'.charCodeAt(0)));
+        }
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1002.Find Common Characters/Solution.ts

@@ -0,0 +1,19 @@
+function commonChars(words: string[]): string[] {
+    const freq: number[] = new Array(26).fill(10000);
+    for (const word of words) {
+        const t: number[] = new Array(26).fill(0);
+        for (const c of word.split('')) {
+            ++t[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+        }
+        for (let i = 0; i < 26; ++i) {
+            freq[i] = Math.min(freq[i], t[i]);
+        }
+    }
+    const res: string[] = [];
+    for (let i = 0; i < 26; ++i) {
+        while (freq[i]-- > 0) {
+            res.push(String.fromCharCode(i + 'a'.charCodeAt(0)));
+        }
+    }
+    return res;
+}