#
# @lc app=leetcode.cn id=7 lang=python3
#
# [7] 整数反转
#

# @lc code=start
class Solution:
    def reverse(self, x: int) -> int:
        tp_rtn = 0
        new_int = 0
        temp_int = abs(x)
        for i in range(len(str(abs(x)))):
            pop = temp_int % 10
            new_int = new_int*10 + pop
            temp_int = temp_int//10
        if new_int.bit_length() <= 31:
            if x < 0:
                tp_rtn = -new_int
            else:
                tp_rtn = new_int
        return tp_rtn

temp = Solution()
print(temp.reverse(-123))
# @lc code=end