[update]

Author: Dream

README.md

@@ -7,9 +7,9 @@
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
 |1464|[Maximum Product of Two Elements in An Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)| [java](./algorithms/maximumProductOfTwoElementsInAnArray/Solution.java) [java_dream](./algorithms/maximumProductOfTwoElementsInAnArray_Dream/maximumProductOfTwoElementsInAnArray_Dream.java)|Easy|
-|1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [java](./algorithms/uniqueNumberOfOccurrences/uniqueNumberOfOccurrences.java)|Easy|
+|1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [java_dream](./algorithms/uniqueNumberOfOccurrences/uniqueNumberOfOccurrences.java)|Easy|
 |1179|[Reformat Department Table](https://leetcode.com/problems/reformat-department-table/)| [Mysql](./algorithms/reformatDepartmentTable/Solution.sql) |Easy| 
-|1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/) | |Easy|
+|1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/) |[java_dream](./algorithms/compareStringsByFrequencyOfTheSmallestCharacter/CompareStringsByFrequencyOfTheSmallestCharacter.java) |Easy|
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | [js](./algorithms/nThTribonacciNumber/nThTribonacciNumber.js)  |Easy|
 |1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | |Easy|
 |1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/) | |Easy|

algorithms/compareStringsByFrequencyOfTheSmallestCharacter/CompareStringsByFrequencyOfTheSmallestCharacter.java

@@ -0,0 +1,44 @@
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+class CompareStringsByFrequencyOfTheSmallestCharacter {
+    public int[] numSmallerByFrequency(String[] queries, String[] words) {
+        int size = queries.length;
+        int wordsSize = words.length;
+        List<Integer> list = new ArrayList<>(size);
+        Map<Integer, Integer> wordsMap = new HashMap<>();
+        for (int p = 0; p < wordsSize; p++) {
+            wordsMap.put(p, f(words[p]));
+        }
+
+        for (int i = 0; i < size; i++) {
+            int q = 0;
+            int queLetterSize = f(queries[i]);
+            for (int j = 0; j < wordsSize; j++) {
+                if (queLetterSize < wordsMap.get(j)) {
+                    q++;
+                }
+            }
+            list.add(q);
+        }
+        int[] ints = list.stream().mapToInt(Integer::intValue).toArray();
+        return ints;
+    }
+
+    public static Integer f(String s) {
+        Map<Character, Integer> map = new HashMap<>(s.length());
+        for (int i = 0; i < s.length(); i++) {
+            char c = s.charAt(i);
+            map.put(c, map.getOrDefault(c, 0) + 1);
+        }
+        Character maxLetter = 'z';
+        for (Map.Entry<Character, Integer> entry : map.entrySet()) {
+            if (entry.getKey().compareTo(maxLetter) < 0) {
+                maxLetter = entry.getKey();
+            }
+        }
+        return map.get(maxLetter);
+    }
+}