leetcode\HammingDistance

Complexity

Total Complexity

5

Size/Duplication

Total Lines	25
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	hammingDistance()	0	9	2
A	hammingDistance2()	0	12	3

<?php

declare(strict_types=1);

namespace leetcode;

class HammingDistance
{
    public static function hammingDistance(int $x, int $y): int
    {
        if ($x === $y) {
            return 0;
        }

        $z = (string)(decbin($x ^ $y));

        return (int)(substr_count($z, '1'));
    }

    public static function hammingDistance2(int $x, int $y): int
    {
        if ($x === $y) {
            return 0;
        }
        [$n, $z] = [0, $x ^ $y];
        while ($z) {
            $z &= $z - 1;
            $n++;
        }

        return $n;
    }
}