leetcode\UglyNumberII::nthUglyNumber2()

Complexity

Conditions	6
Paths	5

Size

Total Lines	23
Code Lines	16

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

<?php
    public static function nthUglyNumber2(int $n): int
    {
        if ($n <= 0) {
            return 0;
        }
        if ($n === 1) {
            return 1;
        }
        $heap = new \SplMinHeap();
        $heap->insert(1);
        for ($i = 1; $i < $n; $i++) {
            $value = $heap->top();
            $heap->extract();
            while (!$heap->isEmpty() && $heap->top() === $value) {
                $value = $heap->top();
                $heap->extract();
            }
            $heap->insert($value * 2);
            $heap->insert($value * 3);
            $heap->insert($value * 5);
        }

        return $heap->top();
    }