add 1897

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1897|[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) ||Easy|String, Greedy|
 |1886|[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) ||Easy|Array|
 |1880|[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) ||Easy|String|
 |1877|[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) ||Medium|Greedy, Sort|

src/main/java/com/fishercoder/solutions/_1897.java

@@ -0,0 +1,21 @@
+package com.fishercoder.solutions;
+
+public class _1897 {
+    public static class Solution1 {
+        public boolean makeEqual(String[] words) {
+            int len = words.length;
+            int[] counts = new int[26];
+            for (String word : words) {
+                for (char c : word.toCharArray()) {
+                    counts[c - 'a']++;
+                }
+            }
+            for (int c : counts) {
+                if (c % len != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}