deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-15 09:57:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Time: 35 ms (96.78%), Space: 28.7 MB (69.5%) - LeetHub

Browse Source
This commit is contained in:
Deven
2025-11-26 20:03:16 -05:00
parent 5f2c51e273
commit 1b166a19b6
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.py
+2 -1
View File
@@ -10,7 +10,8 @@ class Solution:
# iterate over k+1...n - O(n) times # iterate over k+1...n - O(n) times
# - if larger than min in heap, replace min - O(log k) # - if larger than min in heap, replace min - O(log k)
# - else do nothing # - else do nothing
for num in nums: for i in range(k, len(nums)):
num = nums[i]
if num > heap[0]: if num > heap[0]:
heapq.heapreplace(heap, num) heapq.heapreplace(heap, num)