leetcode 7 Reverse digits of an integer

Reverse digits of an integer.

Example1: x = 123, return 321

Example2: x = -123, return -321

class Solution:    # @return an integer    def reverse(self, x):        tmp=abs(x)        if tmp!=x:            flag=1        else:            flag=0        xx=0        while tmp>0:            xx=xx*10+tmp%10            tmp=tmp/10        if flag:            xx=-xx        # print x,xx        if xx>2147483647 or xx<-2147483648:            xx=0        return xx

题目还给了这样的提示：（貌似在Python里不存在溢出问题）

Have you thought about this?Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.