Leetcode刷题

Problem 215

Posted by Ruizhi Ma on October 23, 2020

Solution URL

https://leetcode.com/submissions/detail/412421296/

代码

class Solution {
    public int findKthLargest(int[] nums, int k) {
        //ans: https://leetcode-cn.com/problems/decode-string/solution/decode-string-fu-zhu-zhan-fa-di-gui-fa-by-jyd/
        int len = nums.length;

        //初始化优先队列，lambda表达式重写comparator，最小堆
        PriorityQueue<Integer> minHeap = new PriorityQueue<>(len, (a, b) -> a - b);

        for(int i = 0; i < len; i++){
            minHeap.add(nums[i]);
        }

        for(int i = 0; i < len - k; i++){
            minHeap.poll();
        }

        return minHeap.peek();
    }
}