判断最高位和最低位是否相等,然后都删去,继续……
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0) return false;
int d = 1;
while (x / 10 / d) d *= 10;
while (x) {
if (x / d != x % 10) return false;
x = x % d / 10; d /= 100;
}
return true;
}
};