本文共 1543 字，大约阅读时间需要 5 分钟。

题目：（简单）

标签：字符串、数组

解法一（哈希表）：

def numSmallerByFrequency(self, queries: List[str], words: List[str]) -> List[int]:    word_num = []    for word in words:        count = collections.Counter(word)        word_num.append(count[sorted(count.keys())[0]])    ans = []    for query in queries:        count = collections.Counter(query)        num = count[sorted(count.keys())[0]]        k = 0        for w in word_num:            if w > num:                k += 1        ans.append(k)    return ans

解法二（优化解法一的最小值出现频次计算方法）：

def numSmallerByFrequency(self, queries: List[str], words: List[str]) -> List[int]:    word_num = []    for word in words:        word_num.append(word.count(min(word)))    ans = []    for query in queries:        num = query.count(min(query))        k = 0        for w in word_num:            if w > num:                k += 1        ans.append(k)    return ans

解法三（优化解法二中的查找方法）：

def numSmallerByFrequency(self, queries: List[str], words: List[str]) -> List[int]:    words = [word.count(min(word)) for word in words]    words.sort()    ans = []    for query in queries:        num = query.count(min(query))        count = len(words) - bisect.bisect_right(words, num)        ans.append(count)    return ans

转载地址：https://dataartist.blog.csdn.net/article/details/107108893 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！