1
class Solution {
2
public int reverse(int x) {
3
long reverse = 0;
4
while (x != 0) {
5
int digit = x % 10;
6
reverse = reverse * 10 + digit;
7
x = x / 10;
8
}
9
if (reverse > Integer.MAX_VALUE || reverse < Integer.MIN_VALUE) return 0;
10
return (int) reverse;
11
}
12
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0