703. Kth Largest Element in a Stream

难度：Easy

题目要求

Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Your KthLargest class will have a constructor which accepts an integer k and an integer array nums, which contains initial elements from the stream. For each call to the method KthLargest.add, return the element representing the kth largest element in the stream.

Example:

int k = 3;
int[] arr = [4,5,8,2];
KthLargest kthLargest = new KthLargest(3, arr);
kthLargest.add(3);   // returns 4
kthLargest.add(5);   // returns 5
kthLargest.add(10);  // returns 5
kthLargest.add(9);   // returns 8
kthLargest.add(4);   // returns 8
复制代码

Note: You may assume that nums' length ≥ k-1 and k ≥ 1.

中文说明

设计一个找到数据流中第K大元素的类（class）。注意是排序后的第K大元素，不是第K个不同的元素。

你的 KthLargest 类需要一个同时接收整数 k 和整数数组nums 的构造器，它包含数据流中的初始元素。每次调用 KthLargest.add，返回当前数据流中第K大的元素。

思路1

最小堆：使用了JDK自带的优先队列java.util.PriorityQueue

public class KthLargest {
    PriorityQueue<Integer> minHeap;
    int size;

    public KthLargest(int k, int[] nums) {
        size = k;
        minHeap = new PriorityQueue<>(k);
        for (int num: nums) {
            if (minHeap.size() >= this.size) {
                minHeap.offer(num);
                minHeap.poll();
            } else {
                minHeap.offer(num);
            }
        }
    }

    public int add(int val) {
        minHeap.add(val);
        if (minHeap.size() >= this.size) {
            minHeap.poll();
        }
        return minHeap.peek();
    }
}
复制代码

思路2

二分查找树

转载于:https://juejin.im/post/5cf3e0d451882519a1231d8b