leetcode\KthLargestElementInAnArray

Complexity

Total Complexity

8

Size/Duplication

Total Lines	26
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	findKthLargest2()	0	14	5
A	findKthLargest()	0	8	3

<?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
    {
        if (empty($nums) || $k <= 0) {
            return 0;
        }
        $queue = new \SplMinHeap();
        foreach ($nums as $num) {
            $queue->insert($num);
            if ($queue->count() > $k) {
                $queue->extract();
            }
        }

        return $queue->top();
    }
}