remote dups

Author: JiayangWu

.DS_Store

@@ -5,4 +5,4 @@ def isMajorityElement(self, nums, target):
         :type target: int
         :rtype: bool
         """
-        return nums.count(target) > (len(nums) // 2)
+        return nums.count(target) > len(nums) // 2

102.二叉树的层序遍历/102-二叉树的层序遍历.py

@@ -5,18 +5,24 @@ def numSmallerByFrequency(self, queries, words):
         :type words: List[str]
         :rtype: List[int]
         """
-        def f(word):
-            return word.count(min(word))
 
-        f_words = sorted([f(word) for word in words])
+        def func(word):
+            for char in "abcdefghijklmnopqrstuvwxyz":
+                if char in word:
+                    return word.count(char)
+            return 0
 
-        res = []
-        # print f_words
-        for q in queries:
-            cnt = f(q)
-            # print(bisect.bisect(f_words, cnt))
-            res.append(len(f_words) - bisect.bisect(f_words, cnt))
-            
-        return res
-            
+        def func2(word):
+            record = collections.Counter(word)
+            return record[min(record.keys())]
+        
+        
+        words_count = sorted(map(func2, words))
+        queries_count = map(func2, queries)
+        # print words_count, queries_count
+        ans = []
+        for query in queries_count:
+            index = bisect.bisect(words_count, query) #bisect可以迅速找出有index个数 <= query
+            ans.append(len(words_count) - index)# 减法找有多少个数比query大
+        return ans