How to Compute Kth Largest Element in a Stream?

  • 时间:2020-09-28 16:28:51
  • 分类:网络文摘
  • 阅读:96 次

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.

Compute the K-th Largest using Priority Queue

In the constructor, we store the K and construct a priority queue. Then we need to push the elements into the priority queue.

When we add another element to the priority queue, we need to pop extra elements until we have exactly K elements internally in the priority queue.

Adding one element to the priority queue takes O(logN) time complexity.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class KthLargest {
public:
    KthLargest(int k, vector<int>& nums) {
       this->kth = k;
       for (const auto &n: nums) {
           pq.push(n);
       } 
    }
    
    int add(int val) {
       pq.push(val);
       while (kth < pq.size()) {
           pq.pop();
       }
       return pq.top();
    }
private:
    int kth;
    priority_queue<int, vector<int>, std::greater<int>> pq;
};
 
/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest* obj = new KthLargest(k, nums);
 * int param_1 = obj->add(val);
 */
class KthLargest {
public:
    KthLargest(int k, vector<int>& nums) {
       this->kth = k;
       for (const auto &n: nums) {
           pq.push(n);
       } 
    }
    
    int add(int val) {
       pq.push(val);
       while (kth < pq.size()) {
           pq.pop();
       }
       return pq.top();
    }
private:
    int kth;
    priority_queue<int, vector<int>, std::greater<int>> pq;
};

/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest* obj = new KthLargest(k, nums);
 * int param_1 = obj->add(val);
 */

–EOF (The Ultimate Computing & Technology Blog) —

推荐阅读:
以端午节为话题的作文  清明时节雨 作文  web网站安全防护解决办法大全  站长 不要忘了你的网站是做什么的  2020年 网站站长如何赚钱  seo是否真的已死?网站站长如何赚钱?  站长如何创业赚钱?  妈妈的节日母亲节作文250字  中秋节的夜晚_关于中秋赏月的小学生作文400字  六一儿童节的记忆作文 
评论列表
添加评论