LeetCode / Reverse Integer

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

class Solution:
    def reverse(self, x: int) -> int:
        # Init vars
        digit_list = []
        positive = True if x > 0 else False
        if not positive:
            x = -x

        # Store each digits to stack
        while x != 0:
            digit = x % 10
            digit_list.append(digit)
            x = int(x / 10)

        # Make up result
        result = 0
        while len(digit_list) != 0:
            result = result * 10
            digit = digit_list.pop(0)
            result = result + digit

        if result > 2147483647:
            return 0
        if positive:
            return result
        else:
            return -result