leetcode_kth largest element in an array

Kth Largest Element in an Array

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
(数组定位第k大的元素)

Note:
You may assume k is always valid, 1 ≤ k ≤ array’s length.

Example:

1. 堆

1
2
3
4
5
6
7

import heapq

class :
    def findKthLargest(self, nums: List[int], k: int) -> int:
        heapq.heapify(nums)
        nlarge = heapq.nlargest(k, nums)
        return nlarge[-1]