设计一个找到数据流中第K大元素的类(class)。注意是排序后的第K大元素,不是第K个不同的元素。
你的 KthLargest 类需要一个同时接收整数 k 和整数数组nums 的构造器,它包含数据流中的初始元素。每次调用 KthLargest.add,返回当前数据流中第K大的元素。
示例:
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
说明:
你可以假设 nums 的长度≥ k-1 且k ≥ 1。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/kth-largest-element-in-a-stream
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class KthLargest {
/**
* @param Integer $k
* @param Integer[] $nums
*/
function __construct($k, $nums) {
$this->k = $k;
$this->nums = [];
foreach($nums as $key => $value){
$this->add($value);
}
}
/**
* @param Integer $val
* @return Integer
*/
function add($val) {
$count = count($this->nums);
$half = $count>>1;
if(count($this->nums) <$this->k){
$this->nums[] = $val;
if($count != 0){
$this->nums = $this->siftUp($count,$this->nums);
}
}elseif($val>$this->nums[0]){
$this->nums[0] = $val;
$this->nums = $this->siftDonw(0,$half,$this->nums);
}
return $this->nums[0];
}
//小顶堆由上而下上滤
function siftDonw($index,$half,$data){
$element = $data[$index];
while($index<$half){
$childIndex = ($index<<1)+1;
$rchildIndex = $childIndex+1;
if(isset($data[$rchildIndex]) && $data[$childIndex]>$data[$rchildIndex]){
$childIndex = $rchildIndex;
}
if($element < $data[$childIndex]){
break;
}
$data[$index] = $data[$childIndex];
$index = $childIndex;
}
$data[$index] = $element;
return $data;
}
//小顶堆由下而上下滤
function siftUp($index,$data){
$element = $data[$index];
while($index > 0){
$pIndex = ($index-1)>>1;
$parent = $data[$pIndex];
if($element > $parent){
break;
}
$data[$index] = $parent;
$index = $pIndex;
}
$data[$index] = $element;
return $data;
}
}
/**
* Your KthLargest object will be instantiated and called as such:
* $obj = KthLargest($k, $nums);
* $ret_1 = $obj->add($val);
*/