LeetCode---Reverse Integer

7.Reverse Integer

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 store integers within the 32-bit signed integer range: [−2**31,  2**31 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

翻转整数，同时还要注意内存是否溢出的问题

注意 python中，/ 表示浮点数除法， // 表示整数除法

class Solution:
    def reverse(self, x):
        if x > 0:
            sign = 1
        else:
            sign = -1

        x = abs(x)
        answer = 0
        while x > 0:
            answer = answer*10 + x %10
            x//=10
        t=answer*sign
        
        if t>2**31-1 or t < -2**31:
            return 0
        else:
            return t
        
        
if __name__=='__main__':
    b=123
    a = Solution().reverse(b)
    print(a)