LeetCode: 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³¹, 2³¹ − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

目标是把一个32位的整数（有符号）逆序，我用的方法是先取个位，加到res里，然后整数整除10，res乘10，再加上新得到整数的个位，直到整数变为0。值得注意的是，本题所讨论的是32位整数，有取值范围，计算结果超出该范围则应该返回0。

class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        flag = 1
        if x < 0:
            flag = -1
        x = abs(x)
        res = 0
        while x:
            res *= 10
            res += x % 10
            x //= 10
        if res * flag > 2147483647 or res * flag < -2147483648:
            return 0
        return res * flag