imajinyun /
leetcode-php
| Conditions | 5 |
| Paths | 4 |
| Total Lines | 14 |
| Code Lines | 8 |
| Lines | 0 |
| Ratio | 0 % |
| Changes | 1 | ||
| Bugs | 0 | Features | 0 |
| 1 | <?php |
||
| 19 | public static function findKthLargest2(array $nums, int $k): int |
||
| 20 | { |
||
| 21 | if (empty($nums) || $k <= 0) { |
||
| 22 | return 0; |
||
| 23 | } |
||
| 24 | $queue = new \SplMinHeap(); |
||
| 25 | foreach ($nums as $num) { |
||
| 26 | $queue->insert($num); |
||
| 27 | if ($queue->count() > $k) { |
||
| 28 | $queue->extract(); |
||
| 29 | } |
||
| 30 | } |
||
| 31 | |||
| 32 | return $queue->top(); |
||
| 33 | } |
||
| 35 |
