kth_largest_in_array.py 文件源码

def findKthLargest(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        nums = [-x for x in nums]
        heapq.heapify(nums)

        # ret = None
        # for i in range(k):
        #   ret = heapq.heappop(nums)
        ret = heapq.nsmallest(k, nums)

        return -ret.pop()