leetcode\BinaryPrefixDivisibleByFive

Complexity

Total Complexity

9

Size/Duplication

Total Lines	42
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	prefixesDivByFive2()	0	12	3
A	prefixesDivByFive()	0	12	3
A	prefixesDivByFive3()	0	12	3

<?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;
    }
}