imajinyun /
leetcode-php
| Conditions | 5 |
| Paths | 5 |
| Total Lines | 18 |
| Code Lines | 12 |
| Lines | 0 |
| Ratio | 0 % |
| Changes | 1 | ||
| Bugs | 0 | Features | 0 |
| 1 | <?php |
||
| 9 | public static function isPerfectSquare(int $num): bool |
||
| 10 | { |
||
| 11 | if ($num <= 0) { |
||
| 12 | return false; |
||
| 13 | } |
||
| 14 | [$low, $high] = [0, intdiv($num + 1, 2)]; |
||
| 15 | while ($low <= $high) { |
||
| 16 | $mid = $low + intdiv($high - $low, 2); |
||
| 17 | if ($mid * $mid > $num) { |
||
| 18 | $high = $mid - 1; |
||
| 19 | } elseif ($mid * $mid < $num) { |
||
| 20 | $low = $mid + 1; |
||
| 21 | } else { |
||
| 22 | return true; |
||
| 23 | } |
||
| 24 | } |
||
| 25 | |||
| 26 | return false; |
||
| 27 | } |
||
| 43 |
