前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Leetcode 703. Kth Largest Element in a Stream

Leetcode 703. Kth Largest Element in a Stream

作者头像
Tyan
发布2019-05-25 22:51:49
3890
发布2019-05-25 22:51:49
举报
文章被收录于专栏:SnailTyan

版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://cloud.tencent.com/developer/article/1433879

文章作者:Tyan

博客:noahsnail.com | CSDN | 简书

1. Description

2. Solution

  • Version 1
代码语言:javascript
复制
class KthLargest {
public:
    KthLargest(int k, vector<int> nums) {
        this->k = k;
        sort(nums.begin(), nums.end());
        this->nums = nums;
    }

    int add(int val) {
        int pos = binarySearch(val);
        nums.insert(nums.begin() + pos, val);
        return nums[nums.size() - k];
    }

private:
    int k;
    vector<int> nums;

    int binarySearch(int val) {
        int left = 0;
        int right = nums.size() - 1;
        while(left <= right) {
            int mid = (left + right) / 2;
            if(nums[mid] == val) {
                return mid;
            }
            else if(nums[mid] > val) {
                right = mid - 1;
            }
            else {
                left = mid + 1;
            }
        }
        return left;
    }

};

/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest obj = new KthLargest(k, nums);
 * int param_1 = obj.add(val);
 */
  • Version 2
代码语言:javascript
复制
class KthLargest {
public:
    KthLargest(int k, vector<int> nums) {
        this->k = k;
        sort(nums.begin(), nums.end(), greater<int>());
        if(nums.size() > k) {
            nums.resize(k);
        } 
        this->nums = nums;
    }

    int add(int val) {
        if(nums.size() == 0) {
            nums.push_back(val);
            return nums[k - 1];
        }
        if(val <= nums[k - 1] && nums.size() == k) {
            return nums[k - 1];
        }
        int pos = binarySearch(val);
        nums.insert(nums.begin() + pos, val);
        if(nums.size() > k) {
            nums.pop_back();
        }
        return nums[k - 1];
    }

private:
    int k;
    vector<int> nums;

    int binarySearch(int val) {
        int left = 0;
        int right = nums.size() - 1;
        while(left <= right) {
            int mid = (left + right) / 2;
            if(nums[mid] == val) {
                return mid;
            }
            else if(nums[mid] < val) {
                right = mid - 1;
            }
            else {
                left = mid + 1;
            }
        }
        return left;
    }

};

/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest obj = new KthLargest(k, nums);
 * int param_1 = obj.add(val);
 */
  • Version 3
代码语言:javascript
复制
class KthLargest {
public:
    KthLargest(int k, vector<int> nums) {
        this->k = k;
        for(int i = 0; i < nums.size(); i++) {
            pq.push(nums[i]);
            if(pq.size() > k) {
                pq.pop();
            }
        }
    }

    int add(int val) {
        pq.push(val);
        if(pq.size() > k) {
            pq.pop();
        }
        return pq.top();
    }

private:
    int k;
    priority_queue<int, vector<int>, 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);
 */

Reference

  1. https://leetcode.com/problems/kth-largest-element-in-a-stream/description/
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2018年08月30日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. Description
  • 2. Solution
  • Reference
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档