feat: update ts solution to lc problem: No.1941

Author: thinkasany

solution/1900-1999/1941.Check if All Characters Have Equal Number of Occurrences/README.md

@@ -156,6 +156,17 @@ function areOccurrencesEqual(s: string): boolean {
 }
 ```
 
+```ts
+function areOccurrencesEqual(s: string): boolean {
+    const cnt: number[] = new Array(26).fill(0);
+    for (const c of s) {
+        ++cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+    }
+    const x = cnt.find(v => v);
+    return cnt.every(v => !v || v === x);
+}
+```
+
 ### **PHP**
 
 ```php

solution/1900-1999/1941.Check if All Characters Have Equal Number of Occurrences/README_EN.md

@@ -140,6 +140,17 @@ function areOccurrencesEqual(s: string): boolean {
 }
 ```
 
+```ts
+function areOccurrencesEqual(s: string): boolean {
+    const cnt: number[] = new Array(26).fill(0);
+    for (const c of s) {
+        ++cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)];
+    }
+    const x = cnt.find(v => v);
+    return cnt.every(v => !v || v === x);
+}
+```
+
 ### **PHP**
 
 ```php

solution/1900-1999/1941.Check if All Characters Have Equal Number of Occurrences/Solution.ts

@@ -3,15 +3,6 @@ function areOccurrencesEqual(s: string): boolean {
     for (const c of s) {
         ++cnt[c.charCodeAt(0) - 'a'.charCodeAt(0)];
     }
-    let x = 0;
-    for (const v of cnt) {
-        if (v) {
-            if (!x) {
-                x = v;
-            } else if (x !== v) {
-                return false;
-            }
-        }
-    }
-    return true;
+    const x = cnt.find(v => v);
+    return cnt.every(v => !v || v === x);
 }