목록215. Kth Largest Element in an Array (1)

Scribbling

LeetCode: 215. Kth Largest Element in an Array

O(N*logK) Time Complexity Solution using heap. class Solution: def findKthLargest(self, nums: List[int], k: int) -> int: import heapq h = [] for num in nums: if len(h) < k: heapq.heappush(h, num) else: heapq.heappush(h, num) heapq.heappop(h) return h[0] A better approach is to quick selection, runs within O(N) time on average. But this runs with O(N) memory. import random class Solution: def fin..
Computer Science/Coding Test 2021. 12. 11. 11:26
이전 Prev 1 Next 다음