forked from shuboc/LeetCode-2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
reverse-integer.py
63 lines (56 loc) · 1.65 KB
/
reverse-integer.py
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
from __future__ import print_function
# Time: O(logn) = O(1)
# Space: O(1)
#
# Reverse digits of an integer.
#
# Example1: x = 123, return 321
# Example2: x = -123, return -321
#
# click to show spoilers.
#
# Have you thought about this?
# Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
#
# If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.
#
# Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer,
# then the reverse of 1000000003 overflows. How should you handle such cases?
#
# Throw an exception? Good, but what if throwing an exception is not an option?
# You would then have to re-design the function (ie, add an extra parameter).
class Solution(object):
def reverse(self, x):
"""
:type x: int
:rtype: int
"""
if x < 0:
return -self.reverse(-x)
result = 0
while x:
result = result * 10 + x % 10
x //= 10
return result if result <= 0x7fffffff else 0 # Handle overflow.
def reverse2(self, x):
"""
:type x: int
:rtype: int
"""
if x < 0:
x = int(str(x)[::-1][-1] + str(x)[::-1][:-1])
else:
x = int(str(x)[::-1])
x = 0 if abs(x) > 0x7FFFFFFF else x
return x
def reverse3(self, x):
"""
:type x: int
:rtype: int
"""
s = cmp(x, 0)
r = int(repr(s * x)[::-1])
return s * r * (r < 2 ** 31)
if __name__ == "__main__":
print(Solution().reverse(123))
print(Solution().reverse(-321))