class Solution {
public boolean isPalindrome(int x) {
if( x <0 || (x % 10 == 0 && x != 0)){
return false;
}
int reverseNumber = 0;
while( x > reverseNumber){
reverseNumber = reverseNumber*10 + x%10;
x /= 10;
}
return x == reverseNumber || x == reverseNumber/10;
}
}
现在让我们考虑如何恢复上一半的数字。对于号码1221