feat: add solutions to lc problem: No.1897. Redistribute Characters to

Make All Strings Equal

solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/README.md

@@ -59,10 +59,7 @@ class Solution:
             for c in word:
                 counter[c] += 1
         n = len(words)
-        for count in counter.values():
-            if count % n != 0:
-                return False
-        return True
+        return all(count % n == 0 for count in counter.values())
 ```
 
 ### **Java**
@@ -110,6 +107,47 @@ function makeEqual(words: string[]): boolean {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool makeEqual(vector<string>& words) {
+        vector<int> counter(26, 0);
+        for (string word : words) {
+            for (char c : word) {
+                ++counter[c - 'a'];
+            }
+        }
+        int n = words.size();
+        for (int count : counter) {
+            if (count % n != 0) return false;
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func makeEqual(words []string) bool {
+	counter := [26]int{}
+	for _, word := range words {
+		for _, c := range word {
+			counter[c-'a']++
+		}
+	}
+	n := len(words)
+	for _, count := range counter {
+		if count%n != 0 {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/README_EN.md

@@ -53,10 +53,7 @@ class Solution:
             for c in word:
                 counter[c] += 1
         n = len(words)
-        for count in counter.values():
-            if count % n != 0:
-                return False
-        return True
+        return all(count % n == 0 for count in counter.values())
 ```
 
 ### **Java**
@@ -102,6 +99,47 @@ function makeEqual(words: string[]): boolean {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool makeEqual(vector<string>& words) {
+        vector<int> counter(26, 0);
+        for (string word : words) {
+            for (char c : word) {
+                ++counter[c - 'a'];
+            }
+        }
+        int n = words.size();
+        for (int count : counter) {
+            if (count % n != 0) return false;
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func makeEqual(words []string) bool {
+	counter := [26]int{}
+	for _, word := range words {
+		for _, c := range word {
+			counter[c-'a']++
+		}
+	}
+	n := len(words)
+	for _, count := range counter {
+		if count%n != 0 {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    bool makeEqual(vector<string>& words) {
+        vector<int> counter(26, 0);
+        for (string word : words) {
+            for (char c : word) {
+                ++counter[c - 'a'];
+            }
+        }
+        int n = words.size();
+        for (int count : counter) {
+            if (count % n != 0) return false;
+        }
+        return true;
+    }
+};

solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/Solution.go

@@ -0,0 +1,15 @@
+func makeEqual(words []string) bool {
+	counter := [26]int{}
+	for _, word := range words {
+		for _, c := range word {
+			counter[c-'a']++
+		}
+	}
+	n := len(words)
+	for _, count := range counter {
+		if count%n != 0 {
+			return false
+		}
+	}
+	return true
+}

solution/1800-1899/1897.Redistribute Characters to Make All Strings Equal/Solution.py

@@ -5,7 +5,4 @@ def makeEqual(self, words: List[str]) -> bool:
             for c in word:
                 counter[c] += 1
         n = len(words)
-        for count in counter.values():
-            if count % n != 0:
-                return False
-        return True
+        return all(count % n == 0 for count in counter.values())