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.
Vincoli
1 ≤ n ≤ 10¹⁸. The reversed value always fits a signed 64-bit integer.
Esempi
Input:
n = 352
Output atteso:
expected = 253
Input:
long long n = 352;
Output atteso:
long long expected = 253;
Input:
long n = 352;
Output atteso:
long expected = 253;
Spiegazione
The digits 3, 5, 2 reversed are 2, 5, 3.
Input:
n = 1200
Output atteso:
expected = 21
Input:
long long n = 1200;
Output atteso:
long long expected = 21;
Input:
long n = 1200;
Output atteso:
long expected = 21;
Spiegazione
Reversed digits are 0021; leading zeros are dropped, giving 21.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
The key is to build the result one digit at a time from the end of the number.
Suggerimento 2
Use repeated remainder and division to extract digits in reverse order.
Suggerimento 3
Leading zeros in the reversed form should disappear naturally, so be careful not to preserve them.
Complessità attesa
O(d) time, O(1) extra space