leetcode #7

【id】#7

【title】 Reverse Integer

【description】

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

【idea】

类似字符串操作中的pop和push，数字可以借助求余和整除进行pop、push。
pop: tmp = x % 10
x /= 10
push : res = 10*res + tmp

【code】

# pop and push
class Solution:
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        rev = 0
        sign = cmp(x,0)
        x = abs(x)
        while x != 0:
            tmp = x%10
            x = x/10
            rev = 10*rev + tmp
        return sign*rev if rev >= (-2**31) and rev <=(2**31-1) else 0

【idea】

数字转化为字符串，然后利用字符串的反转。
利用int函数去除反转后出现在前边的0

【code】

class Solution:
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
#         if x < (-2**31) or x > (2**31-1): return 0
        if x < 0:
            x = str(x)[1:]
            x = -(int(x[::-1]))
            return x if x >= (-2**31) and x <=(2**31-1) else 0
        else:
            x = str(x)
            x = int(x[::-1])
            return x if x >= (-2**31) and x <=(2**31-1) else 0