feat: update python solutions to lc problems

Author: yanglbme

lcci/17.20.Continuous Median/README.md

@@ -56,10 +56,10 @@ class MedianFinder:
         self.max_heap = []
 
     def addNum(self, num: int) -> None:
-        heapq.heappush(self.min_heap, num)
-        heapq.heappush(self.max_heap, -heapq.heappop(self.min_heap))
+        heappush(self.min_heap, num)
+        heappush(self.max_heap, -heappop(self.min_heap))
         if len(self.max_heap) - len(self.min_heap) > 1:
-            heapq.heappush(self.min_heap, -heapq.heappop(self.max_heap))
+            heappush(self.min_heap, -heappop(self.max_heap))
 
     def findMedian(self) -> float:
         if len(self.max_heap) > len(self.min_heap):

lcci/17.20.Continuous Median/README_EN.md

@@ -54,10 +54,10 @@ class MedianFinder:
         self.max_heap = []
 
     def addNum(self, num: int) -> None:
-        heapq.heappush(self.min_heap, num)
-        heapq.heappush(self.max_heap, -heapq.heappop(self.min_heap))
+        heappush(self.min_heap, num)
+        heappush(self.max_heap, -heappop(self.min_heap))
         if len(self.max_heap) - len(self.min_heap) > 1:
-            heapq.heappush(self.min_heap, -heapq.heappop(self.max_heap))
+            heappush(self.min_heap, -heappop(self.max_heap))
 
     def findMedian(self) -> float:
         if len(self.max_heap) > len(self.min_heap):

lcci/17.20.Continuous Median/Solution.py

@@ -7,10 +7,10 @@ def __init__(self):
         self.max_heap = []
 
     def addNum(self, num: int) -> None:
-        heapq.heappush(self.min_heap, num)
-        heapq.heappush(self.max_heap, -heapq.heappop(self.min_heap))
+        heappush(self.min_heap, num)
+        heappush(self.max_heap, -heappop(self.min_heap))
         if len(self.max_heap) - len(self.min_heap) > 1:
-            heapq.heappush(self.min_heap, -heapq.heappop(self.max_heap))
+            heappush(self.min_heap, -heappop(self.max_heap))
 
     def findMedian(self) -> float:
         if len(self.max_heap) > len(self.min_heap):

lcof/面试题40. 最小的k个数/README.md

@@ -33,16 +33,14 @@
 ### **Python3**
 
 ```python
-import heapq
-
 class Solution:
     def getLeastNumbers(self, arr: List[int], k: int) -> List[int]:
         if k == 0:
             return []
         heap = []
         for e in arr:
-            heapq.heappush(heap, e)
-        return heapq.nsmallest(k, heap)
+            heappush(heap, e)
+        return nsmallest(k, heap)
 ```
 
 ### **Java**

lcof/面试题40. 最小的k个数/Solution.py

@@ -1,11 +1,8 @@
-import heapq
-
-
 class Solution:
     def getLeastNumbers(self, arr: List[int], k: int) -> List[int]:
         if k == 0:
             return []
         heap = []
         for e in arr:
-            heapq.heappush(heap, e)
-        return heapq.nsmallest(k, heap)
+            heappush(heap, e)
+        return nsmallest(k, heap)

lcof/面试题41. 数据流中的中位数/README.md

@@ -71,9 +71,9 @@ class MedianFinder:
 
     def addNum(self, num: int) -> None:
         if len(self.max_heap) == len(self.min_heap):
-            heapq.heappush(self.min_heap, -heapq.heappushpop(self.max_heap, -num))
+            heappush(self.min_heap, -heappushpop(self.max_heap, -num))
         else:
-            heapq.heappush(self.max_heap, -heapq.heappushpop(self.min_heap, num))
+            heappush(self.max_heap, -heappushpop(self.min_heap, num))
 
     def findMedian(self) -> float:
         return (-self.max_heap[0] + self.min_heap[0]) / 2 if len(self.max_heap) == len(self.min_heap) else self.min_heap[0]

lcof/面试题41. 数据流中的中位数/Solution.py

@@ -8,9 +8,9 @@ def __init__(self):
 
     def addNum(self, num: int) -> None:
         if len(self.max_heap) == len(self.min_heap):
-            heapq.heappush(self.min_heap, -heapq.heappushpop(self.max_heap, -num))
+            heappush(self.min_heap, -heappushpop(self.max_heap, -num))
         else:
-            heapq.heappush(self.max_heap, -heapq.heappushpop(self.min_heap, num))
+            heappush(self.max_heap, -heappushpop(self.min_heap, num))
 
     def findMedian(self) -> float:
         return (

lcof/面试题59 - II. 队列的最大值/README.md

@@ -46,11 +46,7 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-from collections import deque
-
-
 class MaxQueue:
-
     def __init__(self):
         self.p = deque()
         self.q = deque()

lcof/面试题59 - II. 队列的最大值/Solution.py

@@ -1,6 +1,3 @@
-from collections import deque
-
-
 class MaxQueue:
     def __init__(self):
         self.p = deque()

lcof2/剑指 Offer II 059. 数据流的第 K 大数值/README.md

@@ -72,9 +72,9 @@ class KthLargest:
             self.add(num)
 
     def add(self, val: int) -> int:
-        heapq.heappush(self.q, val)
+        heappush(self.q, val)
         if len(self.q) > self.size:
-            heapq.heappop(self.q)
+            heappop(self.q)
         return self.q[0]