Merge pull request onlybooks#35 from Wdean45/patch-1

likejazz · web-flow · commit d19b10783bd8 · 2020-10-05T21:12:17.000+09:00
Update 55-1.py
diff --git a/4-non-linear-data-structures/ch15/55-1.py b/4-non-linear-data-structures/ch15/55-1.py
@@ -8,7 +8,7 @@ def findKthLargest(self, nums: List[int], k: int) -> int:
         for n in nums:
             heapq.heappush(heap, -n)
 
-        for _ in range(k):
+        for _ in range(1, k):
             heapq.heappop(heap)
 
         return -heapq.heappop(heap)
