[LeeCode] 215. Kth Largest Element in an Array (Python)

215. Kth Largest Element in an Array

Medium

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.

Example 1:

Input: [3,2,1,5,6,4] and k = 2
Output: 5

Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4

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

 

笔记：

方法1：快排

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

方法2：最小堆 https://blog.csdn.net/Haskei/article/details/53107172

class Solution:
    def findKthLargest(self, nums: List[int], k: int) -> int:
        def shift_down(i):
            finished = False
            min_i = i
            temp_i = i * 2 + 1
            while temp_i < k and not finished:
                if nums[temp_i] < nums[i]:
                    min_i = temp_i
                temp_i += 1
                if temp_i < k and nums[temp_i] < nums[min_i]:
                    min_i = temp_i
                if i != min_i:
                    nums[i], nums[min_i] = nums[min_i], nums[i]
                    i = min_i
                    temp_i = 2 * i + 1
                else:
                    finished = True

        temp_i = (k - 2) // 2
        while temp_i >= 0:
            shift_down(temp_i)
            temp_i -= 1

        for i in range(k, len(nums)):
            if nums[i] > nums[0]:
                nums[0] = nums[i]
                shift_down(0)
        return nums[0]