feat: add typescript solution to lc problem: No.1897.Redistribute Characters to Make All Strings Equal (doocs#452)

zhaocchen · web-flow · commit 90911cc30d03 · 2021-06-16T09:12:48.000+08:00
diff --git a/solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/README.md b/solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/README.md
@@ -89,6 +89,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function makeEqual(words: string[]): boolean {
+    let n = words.length;
+    let letters = new Array(26).fill(0);
+    for (let word of words) {
+        for (let i = 0; i < word.length; ++i) {
+            ++letters[word.charCodeAt(i) - 97];
+        }
+    }
+
+    for (let i = 0; i < letters.length; ++i) {
+        if (letters[i] % n != 0) {
+            return false;
+        }
+    }
+    return true;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/README_EN.md b/solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/README_EN.md
@@ -81,6 +81,27 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function makeEqual(words: string[]): boolean {
+    let n = words.length;
+    let letters = new Array(26).fill(0);
+    for (let word of words) {
+        for (let i = 0; i < word.length; ++i) {
+            ++letters[word.charCodeAt(i) - 97];
+        }
+    }
+
+    for (let i = 0; i < letters.length; ++i) {
+        if (letters[i] % n != 0) {
+            return false;
+        }
+    }
+    return true;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/Solution.ts b/solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/Solution.ts
@@ -0,0 +1,16 @@
+function makeEqual(words: string[]): boolean {
+    let n = words.length;
+    let letters = new Array(26).fill(0);
+    for (let word of words) {
+        for (let i = 0; i < word.length; ++i) {
+            ++letters[word.charCodeAt(i) - 97];
+        }
+    }
+
+    for (let i = 0; i < letters.length; ++i) {
+        if (letters[i] % n != 0) {
+            return false;
+        }
+    }
+    return true;
+};
