leetcode\OneBitAndTwoBitCharacters

Complexity

Total Complexity

7

Size/Duplication

Total Lines	25
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	isOneBitCharacter()	0	10	3
A	isOneBitCharacter2()	0	11	4

<?php

declare(strict_types=1);

namespace leetcode;

class OneBitAndTwoBitCharacters
{
    public static function isOneBitCharacter(array $bits): bool
    {
        if (empty($bits)) {
            return false;
        }
        $n = count($bits);

        return $n <= 2
            ? $bits[0] === 0
            : self::isOneBitCharacter(array_slice($bits, $bits[0] + 1, $n));
    }

    public static function isOneBitCharacter2(array $bits): bool
    {
        if (empty($bits)) {
            return false;
        }
        [$i, $n] = [0, count($bits)];
        while ($i < $n - 1) {
            $i += $bits[$i] === 0 ? 1 : 2;
        }

        return $i === $n - 1;
    }
}