1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public boolean isPalindrome (int x){
if(x < 0) {
return false;
}
long reversed = 0;
long temp = x;
while(temp != 0) {
int digit = (int) (temp % 10);
reversed = reversed * 10 + digit;
temp /= 10;
}
return (x = reversed);
}
}
|