BinaryPrefixDivisibleByFive::prefixesDivByFive3() - Code Metrics - Inspection of "Update binary-prefix-divisible-by-5 solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 5c1684...54d8c9 )

by Jinyun

created 2021-05-15 09:06 UTC

BinaryPrefixDivisibleByFive::prefixesDivByFive3() A

↳ Parent: BinaryPrefixDivisibleByFive

Complexity

Conditions	3
Paths	3

Size

Total Lines	12
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
eloc	7
c	0
b	0
f	0
dl	0
loc	12
rs	10
cc	3
nc	3
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class BinaryPrefixDivisibleByFive
{
    public static function prefixesDivByFive(array $arr): array
    {
        if (empty($arr)) {
            return [];
        }
        [$ans, $num] = [[], 0];
        foreach ($arr as $val) {
            $num = $num * 2 + $val;
            array_push($ans, $num % 5 === 0);
        }

        return $ans;
    }

    public static function prefixesDivByFive2(array $arr): array
    {
        if (empty($arr)) {
            return [];
        }
        $num = 0;
        foreach ($arr as $key => $val) {
            $num = $num * 2 % 5 + $val;
            $arr[$key] = $num % 5 === 0;
        }

        return $arr;
    }

    public static function prefixesDivByFive3(array $arr): array
    {
        if (empty($arr)) {
            return [];
        }
        $num = 0;
        foreach ($arr as $key => $val) {
            $num = (($num << 1) + $val) % 5;
            $arr[$key] = $num === 0;
        }

        return $arr;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class BinaryPrefixDivisibleByFive
8			{
9			public static function prefixesDivByFive(array $arr): array
10			{
11			if (empty($arr)) {
12			return [];
13			}
14			[$ans, $num] = [[], 0];
15			foreach ($arr as $val) {
16			$num = $num * 2 + $val;
17			array_push($ans, $num % 5 === 0);
18			}
19
20			return $ans;
21			}
22
23			public static function prefixesDivByFive2(array $arr): array
24			{
25			if (empty($arr)) {
26			return [];
27			}
28			$num = 0;
29			foreach ($arr as $key => $val) {
30			$num = $num * 2 % 5 + $val;
31			$arr[$key] = $num % 5 === 0;
32			}
33
34			return $arr;
35			}
36
37			public static function prefixesDivByFive3(array $arr): array
38			{
39			if (empty($arr)) {
40			return [];
41			}
42			$num = 0;
43			foreach ($arr as $key => $val) {
44			$num = (($num << 1) + $val) % 5;
45			$arr[$key] = $num === 0;
46			}
47
48			return $arr;
49			}
50			}
51

imajinyun / leetcode-php

Push — master ( 5c1684...54d8c9 )

BinaryPrefixDivisibleByFive::prefixesDivByFive3() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like