【LeetCode】7. Reverse Integer

Introduction

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.

Solution

class Solution(object):
    def reverse(self, x):
        """
        :type x: int
        :rtype: int
        """
        x = str(x)
        y = ""
        if x[0] == "-":
            y = y + x[0]
            for i in range(len(x)-1, 0, -1):
                y += x[i]
        else:
            for i in range(len(x)-1, -1, -1):
                y += x[i]
        if int(y) > 2**31-1 or int(y) < -2**31:
            return 0
        else:
            return int(y)

Code

GitHub：https://github.com/roguesir/LeetCode-Algorithm

• 更新時間：2019-03-01