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

思路

回文数字，从右往左每次取一个数放到新数字的最后，全部遍历一遍后，原来的最小位就被放在了新数字的最高位。

代码实现

class Solution:
    MAX_NUM = 2 ** 31 # 注意题目中要求了数字的大小，最大31是因为有一位代表符号
    def reverse(self, x: int) -> int:
        res = 0
        flag = 1 if x >=0 else -1

        while x != 0:
            res = abs(x) % 10 + res * 10 # 此处必须取绝对值,python 取余算法负数是向下取整
            x = abs(x) // 10

        return res * flag if res < self.MAX_NUM else 0

if __name__ == '__main__':
    x = -123
    solution = Solution()
    print(solution.reverse(x))