按照昨天整数反转题目的思路,负数不是回文数,0是回文数单独考虑,判断反转后的整数与原数是否相等
class Solution {
public boolean isPalindrome(int x) {
int x1 = x;
int num = 0;
while (x != 0) {
num = num * 10;
num = num + x % 10;
x = x/10;
}
if(x1 == num && x1 >= 0){
return true;
}
else {
return false;
}
}
}```