[7] Reverse Integer

https://leetcode.com/problems/reverse-integer/description/

• algorithms
• Easy (24.63%)
• Source Code: 7.reverse-integer.py
• Total Accepted: 660K
• Total Submissions: 2.6M
• Testcase Example: '123'

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(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        x = str(x)
        negtive = True if x[0] == '-' else False

        if negtive:
            x = -1 * int(x[1:][::-1])
        else: x = int(x[::-1])

        # print('x', x)
        if x < -pow(2,31) or x > pow(2,31)-1: return 0
        return x


# x = -123
# s = Solution()
# print s.reverse(x)