力扣第二十七天(heap(priority queue) topic)

文章目录
problem Ⅰsolution 1
problem Ⅱsolution

problem Ⅰ
215. Kth Largest Element in an Array Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
Example 1:
Input: nums = [3,2,1,5,6,4], k = 2
Output: 5

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

so

力扣第二十七天(heap(priority queue) topic)最先出现在Python成神之路。