feat: add solutions to lc problem: No.1941. Check if All Characters Have

Equal Number of Occurrences

Author: yanglbme

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

@@ -48,15 +48,44 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def areOccurrencesEqual(self, s: str) -> bool:
+        counter = collections.Counter(s)
+        cnt = -1
+        for c, times in counter.items():
+            if cnt == -1:
+                cnt = times
+            elif cnt != times:
+                return False
+        return True
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean areOccurrencesEqual(String s) {
+        int[] counter = new int[26];
+        for (char c : s.toCharArray()) {
+            ++counter[c - 'a'];
+        }
+        int cnt = -1;
+        for (int i = 0; i < 26; ++i) {
+            if (counter[i] == 0) {
+                continue;
+            }
+
+            if (cnt == -1) {
+                cnt = counter[i];
+            } else if (cnt != counter[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

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

@@ -42,13 +42,42 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def areOccurrencesEqual(self, s: str) -> bool:
+        counter = collections.Counter(s)
+        cnt = -1
+        for c, times in counter.items():
+            if cnt == -1:
+                cnt = times
+            elif cnt != times:
+                return False
+        return True
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean areOccurrencesEqual(String s) {
+        int[] counter = new int[26];
+        for (char c : s.toCharArray()) {
+            ++counter[c - 'a'];
+        }
+        int cnt = -1;
+        for (int i = 0; i < 26; ++i) {
+            if (counter[i] == 0) {
+                continue;
+            }
+
+            if (cnt == -1) {
+                cnt = counter[i];
+            } else if (cnt != counter[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,21 @@
+class Solution {
+    public boolean areOccurrencesEqual(String s) {
+        int[] counter = new int[26];
+        for (char c : s.toCharArray()) {
+            ++counter[c - 'a'];
+        }
+        int cnt = -1;
+        for (int i = 0; i < 26; ++i) {
+            if (counter[i] == 0) {
+                continue;
+            }
+
+            if (cnt == -1) {
+                cnt = counter[i];
+            } else if (cnt != counter[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}

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

@@ -0,0 +1,10 @@
+class Solution:
+    def areOccurrencesEqual(self, s: str) -> bool:
+        counter = collections.Counter(s)
+        cnt = -1
+        for c, times in counter.items():
+            if cnt == -1:
+                cnt = times
+            elif cnt != times:
+                return False
+        return True