一. 题目
-
题目
-
示例
二. 方法一
-
解题思路
-
解题代码
# 统计每个字符串中最小字符的数量 def minCount(self, word: str): lst = list(word) count = lst.count(min(lst)) return count def numSmallerByFrequency(self, queries: List[str], words: List[str]) -> List[int]: result = [] # 创建两个列表arr 和 arr1, 分别用于存放words和queries中每个元素中最小字符的数量 arr = [0 for _ in range(len(words))] arr1 = [0 for _ in range(len(queries))] for index in range(len(words)): arr[index] = self.minCount(words[index]) for index in range(len(queries)): arr1[index] = self.minCount(queries[index]) # 统计arr1中每个元素值小于arr中元素值的数量 # 并将统计的结果写入result列表即可 for ele in arr1: count = 0 for e in arr: if ele < e: count += 1 result.append(count) return result
-
分析
时间复杂度: O(n^2)
空间复杂度: O(n^2)