LeetCode --- 703. Kth Largest Element in a Stream 解题报告

杨鑫newlfe

于 2020-06-06 13:21:12 发布

阅读量330

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 算法 LeetCode 文章标签： LeetCode Python 算法

本文链接：https://blog.csdn.net/u012965373/article/details/106586316

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

设计一个类来找到流中的第k个最大元素。这不是第k个不同的元素，而是按排序顺序的第k个元素。类的构造函数接受一个整数k和一个初始流元素的整数数组。每次调用方法时，返回流中的第k个最大元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
kthLarg

了解本专栏