leetcode\ValidPerfectSquare

Complexity

Total Complexity

8

Size/Duplication

Total Lines	34
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	isPerfectSquare()	0	18	5
A	isPerfectSquare2()	0	12	3

<?php

declare(strict_types=1);

namespace leetcode;

class ValidPerfectSquare
{
    public static function isPerfectSquare(int $num): bool
    {
        if ($num <= 0) {
            return false;
        }
        [$low, $high] = [0, intdiv($num + 1, 2)];
        while ($low <= $high) {
            $mid = $low + intdiv($high - $low, 2);
            if ($mid * $mid > $num) {
                $high = $mid - 1;
            } elseif ($mid * $mid < $num) {
                $low = $mid + 1;
            } else {
                return true;
            }
        }

        return false;
    }

    public static function isPerfectSquare2(int $num): bool
    {
        if ($num <= 0) {
            return false;
        }
        $i = $n = 1;
        while ($n < $num) {
            $i++;
            $n = $i * $i;
        }

        return $n === $num;
    }
}