Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
class Solution(object):
def reverse(self, x):
input = x
result = []
output = []
sum = 0
if input<0:
index = 0
input = 0 - input
else:
index = 1
str_input = str(input)
result = list(str_input)
count = len(result)
for i in range(count):
sum += pow(10,count-i-1) * int(result[count-1-i])
if index == 0:
sum = 0 - sum
if sum > pow(2,31)-1 or sum< 0-pow(2,31):
sum = 0
return sum