-
Notifications
You must be signed in to change notification settings - Fork 0
/
7-reverseDigit.py
60 lines (45 loc) · 1.35 KB
/
7-reverseDigit.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
# -*- coding: utf-8 -*-
"""
@author : zenithude
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: [−2**31, 2**31 − 1]. For the
purpose of this problem, assume that your function returns 0 when the
reversed integer overflows.
Remarque: Supposons que nous ayons affaire à un environnement qui ne
pourrait stocker que des entiers dans la plage d'entiers signés 32 bits: [
−2**31, 2**31 - 1]. Aux fins de ce problème, supposez que votre fonction
renvoie 0 lorsque l'entier inversé déborde.
"""
class Solution(object):
def reverse(self, x):
"""
:type x: int
:rtype: int
"""
if -2 ** 31 < x < 2 ** 31 - 1:
listX = list(str(abs(x)))
listX.reverse()
if x < 0:
y = '-' + ''.join(listX)
else:
y = ''.join(listX)
if -2 ** 31 < int(y) < 2 ** 31 - 1:
return int(y)
else:
return 0
return 0
s = Solution()
print(s.reverse(-130))
x = 5321252021
print(s.reverse(x))
print(x < 2 ** 31)