Problema
Write the decimal digits of n in reverse order and return the resulting number. Zeros that end up at the front disappear, so 1200 becomes 21.
Implement reverse_number(n).
Input
n: A positive integer.
Output
Return the reversed number.
Restricciones
1 ≤ n ≤ 10¹⁸. The reversed value always fits a signed 64-bit integer.
Ejemplos
Entrada:
n = 352
Salida esperada:
expected = 253
Entrada:
long long n = 352;
Salida esperada:
long long expected = 253;
Entrada:
long n = 352;
Salida esperada:
long expected = 253;
Explicación
The digits 3, 5, 2 reversed are 2, 5, 3.
Entrada:
n = 1200
Salida esperada:
expected = 21
Entrada:
long long n = 1200;
Salida esperada:
long long expected = 21;
Entrada:
long n = 1200;
Salida esperada:
long expected = 21;
Explicación
Reversed digits are 0021; leading zeros are dropped, giving 21.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
The key is to build the result one digit at a time from the end of the number.
Pista 2
Use repeated remainder and division to extract digits in reverse order.
Pista 3
Leading zeros in the reversed form should disappear naturally, so be careful not to preserve them.
Complejidad esperada
O(d) time, O(1) extra space