题目:
Determine whether an integer is a palindrome. Do this without extra space.
一种是可以 reverse 整个 integer, 但会导致overflow, 更好的办法是头和尾逐个比较。
public static boolean checkPalindrome(int n) {
if (n < 0) return false;
int dev = 1;
while (n / dev >= 10) {
dev *= 10;
}
while (n > 0) {
int head = n / dev;
int tail = n % 10;
if (head != tail) return false;
n %= dev;
n /= 10;
dev /= 100;
}
return true;
}