Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output:  321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:
Assume we are dealing with an environment which could only hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

解題思路：

將整數(shù)轉(zhuǎn)化為字符串，處理完后轉(zhuǎn)化為整數(shù)

注意點(diǎn)：

原數(shù)字和轉(zhuǎn)化后的數(shù)字都不能溢出

Python實(shí)現(xiàn)：

class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        min = -2**31
        max = 2**31 - 1
        if  x < min or x > max or x == 0:  # 0 不用反轉(zhuǎn)
            return 0
        if x > 0:
            rev = int(str(x)[::-1])  # [::-1]字符串反轉(zhuǎn)
        else:
            rev = -int(str(x)[1:][::-1])
        if rev < min or rev > max:  # 反轉(zhuǎn)后的數(shù)字溢出
            return 0
        return rev

a = 1023456789
b = Solution()
print(b.reverse(a))  # 轉(zhuǎn)化后的數(shù)字溢出，返回0