比较字符串最小字母出现频次

/*
 * 思路：
 * 1. 定义函数f(s)来计算字符串s中字典序最小字母的出现频次。
 * 2. 使用Java Stream API来处理queries和words数组。
 * 3. 对于每个查询queries[i]，计算其f值，并统计满足f(queries[i]) < f(words[j])的词的数量。
 * 4. 返回结果数组。
 */
import java.util.*;
import java.util.stream.*;

public class Solution {
    public static int[] numSmallerByFrequency(String[] queries, String[] words) {
        int[] wordFreqs = Arrays.stream(words).mapToInt(Solution::f).toArray();
        return Arrays.stream(queries)
                     .mapToInt(query -> (int) Arrays.stream(wordFreqs)
                                                  .filter(wordFreq -> f(query) < wordFreq)
                                                  .count())
                     .toArray();
    }

    private static int f(String s) {
        return s.chars()
                .mapToObj(c -> (char) c)
                .collect(Collectors.groupingBy(c -> c, Collectors.counting()))
                .entrySet()
                .stream()
                .min(Map.Entry.comparingByKey())
                .map(Map.Entry::getValue)
                .orElse(0L)
                .intValue();
    }

    public static void main(String[] args) {
        String[] queries = {"cbd"};
        String[] words = {"zaaaz"};
        System.out.println(Arrays.toString(numSmallerByFrequency(queries, words)));
    }
}