[Leetcode] 215. Kth Largest Element in an Array

sort

class Solution:
    def findKthLargest(self, nums: List[int], k: int) -> int:
        return sorted(nums, reverse=True)[k-1]

heap

import heapq

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