Problema
A perfect square is a number like 0, 1, 4, 9 or 16 that equals k × k for some integer k. Negative numbers are never perfect squares. Check with integer arithmetic so that very large inputs are handled exactly.
Implement perfect_square_check(n).
Input
n: The integer to test. It may be negative.
Output
Return true if n = k × k for some integer k, otherwise false.
Restricciones
−10^18 ≤ n ≤ 10^18
Ejemplos
Entrada:
n = 49
Salida esperada:
expected = True
Entrada:
long long n = 49;
Salida esperada:
bool expected = true;
Entrada:
long n = 49;
Salida esperada:
bool expected = true;
Explicación
49 = 7 × 7, so the answer is true.
Entrada:
n = 50
Salida esperada:
expected = False
Entrada:
long long n = 50;
Salida esperada:
bool expected = false;
Entrada:
long n = 50;
Salida esperada:
bool expected = false;
Explicación
7 × 7 = 49 and 8 × 8 = 64, and 50 falls between them, so the answer is false.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Find the integer square root r of n first.
Pista 2
n is a perfect square exactly when r × r equals n.
Pista 3
Return false right away for negative numbers.
Complejidad esperada
O(log n) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.