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

풀이

class Solution:
    def reverse(self, x: int) -> int:
        if (x == 0) :
            return 0

        if (x < 0) :
            neg = True
        else :
            neg = False

        numStr = str(abs(x))
        numStr = numStr[::-1]
        if (neg == True) :
            result = int('-' + numStr)
        else :
            result = int(numStr)

        max_result = pow(2,31)
        if ( -max_result < result < max_result - 1) :
            return result
        else :
            return 0