Reverse Integer
easySave
Math
Given a 32-bit signed integer, reverse its digits. Write a function that returns the reversed integer. If the reversed integer overflows (i.e., exceeds the signed 32-bit integer range [-2^31, 2^31 - 1]), the function should return 0.
Example 1
Input
[ 123 ]
Output
321
Explanation. Reversing the digits of 123 results in 321.
Example 2
Input
[ -123 ]
Output
-321
Explanation. Reversing the digits of -123 results in -321.
Example 3
Input
[ 120 ]
Output
21
Explanation. Reversing the digits of 120 (which has a trailing zero) results in 21.
Example 4
Input
[ 1534236469 ]
Output
0
Explanation. Reversal of 1534236469 overflows a 32-bit integer, hence returns 0.
Follow-up: Can this implementation be optimized further? Are there any edge cases that the provided solution does not cover?
Constraints:
The function should handle both positive and negative inputs.
- Views
- 2