Leetcode: Reverse Integer

Reverse Integer | LeetCode OJ

With help of Int to string conversion and string to int conversion we can solve this problem easily. We also need to check for integer overflow.

Remarks:

1. O(n) space complexity where n is the length of integer
2. O(n) time complexity for reversing the string of length n

class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        if x >= 0:
            val = int(str(x)[::-1])
        else:
            val = -1 * int(str(-x)[::-1])
        return 0 if abs(val) > 2147483647 else val