[Leetcode] 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 hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

python:

class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        if x==0:
            return x
        
        
        symbol = x/abs(x)
        x=abs(x)
        array = []
        index = 0
        while x!=0:
            array.append(x%10)
            x=x/10
            index +=1
        ret = 0
        for pos in range(len(array)):
            if pos==0 and array[pos]==0:
                continue
            ret = ret*10
            ret+=array[pos]
            
        if ret<-2147483648 or ret> 2147483647:
            return 0
            
        return ret*symbol