题解 | #寻找第K大#
寻找第K大
http://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf
直接创建堆来解决问题
class Solution:
def findKth(self , a: List[int], n: int, K: int) -> int:
# write code here
if not a:
return None
import heapq
heapq.heapify(a)
res = heapq.nlargest(K, a)
return res[K - 1]