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

Let’s define a function f(s) over a non-empty string s, which calculates the frequency of the smallest character in s. For example, if s = “dcce” then f(s) = 2 because the smallest character is “c” and its frequency is 2.
Now, given string arrays queries and words, return an integer array answer, where each answer[i] is the number of words such that f(queries[i]) < f(W), where W is a word in words.

class Solution:
    def numSmallerByFrequency(self, queries: List[str], words: List[str]) -> List[int]:
        nums1 = [item.count(min(item)) for item in queries]
        nums2 = [item.count(min(item)) for item in words]
        res = []
        for i in nums1:
            count = 0
            for j in nums2:
                if j>i:
                    count+=1
            res.append(count)
        return res