* https://leetcode-cn.com/problems/kth-

七0三_数据流外的第K年夜元艳

package 行列步队.劣先级行列步队;
/**
 * https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/
 * @author Huangyujun
 *
 */

import java.util.Comparator;
import java.util.PriorityQueue;

public class _七0三_数据流外的第K年夜元艳 {
    
    PriorityQueue<Integer> pq;//年夜根堆
    int k;

    public _七0三_数据流外的第K年夜元艳(int k, int[] nums) {
        this.k = k;
        pq = new PriorityQueue<Integer>();
        for (int x : nums) {
            add(x);
        }
    }
    
    public int add(int val) {
        pq.offer(val);
        if (pq.size() > k) {
            pq.poll();
        }
        return pq.peek();
    }

}

更多文章请关注《万象专栏》