for testing and deploying your application
for finding and fixing issues
for empowering human code reviews
<?php
declare(strict_types=1);
namespace leetcode;
class KthLargestElementInAnArray
{
public static function findKthLargest(array $nums, int $k): int
if (empty($nums) || $k <= 0) {
return 0;
}
sort($nums);
return $nums[count($nums) - $k];
public static function findKthLargest2(array $nums, int $k): int
$queue = new \SplMinHeap();
foreach ($nums as $num) {
$queue->insert($num);
if ($queue->count() > $k) {
$queue->extract();
return $queue->top();
imajinyun /
leetcode-php
