refactor: update ts solution to lc problem: No.1002 (#3044)

Author: rain84

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

@@ -164,23 +164,24 @@ func commonChars(words []string) (ans []string) {
 
 ```ts
 function commonChars(words: string[]): string[] {
-    const freq: number[] = new Array(26).fill(10000);
+    const freq: number[] = Array(26).fill(Number.POSITIVE_INFINITY);
+    const aCode = 'a'.charCodeAt(0);
     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)];
+        const t: number[] = Array(26).fill(0);
+        for (const c of word) {
+            ++t[c.charCodeAt(0) - aCode];
         }
         for (let i = 0; i < 26; ++i) {
             freq[i] = Math.min(freq[i], t[i]);
         }
     }
-    const res: string[] = [];
+    const ans: string[] = [];
     for (let i = 0; i < 26; ++i) {
-        while (freq[i]-- > 0) {
-            res.push(String.fromCharCode(i + 'a'.charCodeAt(0)));
+        if (freq[i]) {
+            ans.push(...String.fromCharCode(i + aCode).repeat(freq[i]));
         }
     }
-    return res;
+    return ans;
 }
 ```
 

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

@@ -151,23 +151,24 @@ func commonChars(words []string) (ans []string) {
 
 ```ts
 function commonChars(words: string[]): string[] {
-    const freq: number[] = new Array(26).fill(10000);
+    const freq: number[] = Array(26).fill(Number.POSITIVE_INFINITY);
+    const aCode = 'a'.charCodeAt(0);
     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)];
+        const t: number[] = Array(26).fill(0);
+        for (const c of word) {
+            ++t[c.charCodeAt(0) - aCode];
         }
         for (let i = 0; i < 26; ++i) {
             freq[i] = Math.min(freq[i], t[i]);
         }
     }
-    const res: string[] = [];
+    const ans: string[] = [];
     for (let i = 0; i < 26; ++i) {
-        while (freq[i]-- > 0) {
-            res.push(String.fromCharCode(i + 'a'.charCodeAt(0)));
+        if (freq[i]) {
+            ans.push(...String.fromCharCode(i + aCode).repeat(freq[i]));
         }
     }
-    return res;
+    return ans;
 }
 ```
 

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

@@ -1,19 +1,20 @@
 function commonChars(words: string[]): string[] {
-    const freq: number[] = new Array(26).fill(10000);
+    const freq: number[] = Array(26).fill(Number.POSITIVE_INFINITY);
+    const aCode = 'a'.charCodeAt(0);
     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)];
+        const t: number[] = Array(26).fill(0);
+        for (const c of word) {
+            ++t[c.charCodeAt(0) - aCode];
         }
         for (let i = 0; i < 26; ++i) {
             freq[i] = Math.min(freq[i], t[i]);
         }
     }
-    const res: string[] = [];
+    const ans: string[] = [];
     for (let i = 0; i < 26; ++i) {
-        while (freq[i]-- > 0) {
-            res.push(String.fromCharCode(i + 'a'.charCodeAt(0)));
+        if (freq[i]) {
+            ans.push(...String.fromCharCode(i + aCode).repeat(freq[i]));
         }
     }
-    return res;
+    return ans;
 }