https://leetcode.com/problems/reverse-integer/description/
Given a 32-bit signed integer, reverse digits of an integer.
Input: 123 Output: 321
Input: -123 Output: -321
Input: 120 Output: 21Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
class Solution(object):
def reverse(self, x):
"""
:type x: int
:rtype: int
"""
isPostive = True
if x < 0:
isPostive = False
x = - x
max = 2 ** 31 - 1
min = - max - 1
result = 0
while x > 0:
result = result * 10 + x % 10
x /= 10
if result > max or result < min:
return 0
if isPostive:
return result
return - result