UglyNumberII::nthUglyNumber() - Code Metrics - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

UglyNumberII::nthUglyNumber() B
last analyzed 2022-03-29 06:17 UTC

↳ Parent: UglyNumberII

Complexity

Conditions	7
Paths	11

Size

Total Lines	26
Code Lines	17

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	17
c	2
b	0
f	0
dl	0
loc	26
rs	8.8333
cc	7
nc	11
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class UglyNumberII
{
    public static function nthUglyNumber(int $n): int
    {
        if ($n <= 0) {
            return 0;
        }
        if ($n === 1) {
            return 1;
        }
        $ans = [1];
        $i2 = $i3 = $i5 = 0;
        while (count($ans) < $n) {
            [$m2, $m3, $m5] = [$ans[$i2] * 2, $ans[$i3] * 3, $ans[$i5] * 5];
            $min = min($m2, min($m3, $m5));
            if ($min === $m2) {
                $i2++;
            }
            if ($min === $m3) {
                $i3++;
            }
            if ($min === $m5) {
                $i5++;
            }
            $ans[] = $min;
        }

        return array_pop($ans);
    }

    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();
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class UglyNumberII
8			{
9			public static function nthUglyNumber(int $n): int
10			{
11			if ($n <= 0) {
12			return 0;
13			}
14			if ($n === 1) {
15			return 1;
16			}
17			$ans = [1];
18			$i2 = $i3 = $i5 = 0;
19			while (count($ans) < $n) {
20			[$m2, $m3, $m5] = [$ans[$i2] * 2, $ans[$i3] * 3, $ans[$i5] * 5];
21			$min = min($m2, min($m3, $m5));
22			if ($min === $m2) {
23			$i2++;
24			}
25			if ($min === $m3) {
26			$i3++;
27			}
28			if ($min === $m5) {
29			$i5++;
30			}
31			$ans[] = $min;
32			}
33
34			return array_pop($ans);
35			}
36
37			public static function nthUglyNumber2(int $n): int
38			{
39			if ($n <= 0) {
40			return 0;
41			}
42			if ($n === 1) {
43			return 1;
44			}
45			$heap = new \SplMinHeap();
46			$heap->insert(1);
47			for ($i = 1; $i < $n; $i++) {
48			$value = $heap->top();
49			$heap->extract();
50			while (!$heap->isEmpty() && $heap->top() === $value) {
51			$value = $heap->top();
52			$heap->extract();
53			}
54			$heap->insert($value * 2);
55			$heap->insert($value * 3);
56			$heap->insert($value * 5);
57			}
58
59			return $heap->top();
60			}
61			}
62

imajinyun / leetcode-php

UglyNumberII::nthUglyNumber() B last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

UglyNumberII::nthUglyNumber() B
last analyzed 2022-03-29 06:17 UTC