1
import bisect
2

3

4
class Solution:
5
def reverse(self, x: int) -> int:
6

7
flag = 0
8
if x < 0:
9
x = abs(x)
10
flag = 1
11

12
l = [i for i in str(x)]
13
l.reverse()
14

15
ret = "".join(l)
16
ret = int(ret)
17

18
if flag == 1:
19
ret = ret * -1
20

21
if (ret >= (-(2**31))) and (ret <= ((2**31) - 1)):
22
return ret
23
else:
24
return 0

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0