Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to string, note the restriction of using extra space.
You could also try reversing an integer. However, if you have solved the problem “Reverse Integer”, you know that the reversed integer might overflow. How would you handle such case?
There is a more generic way of solving this problem.
思路:每次都取出数的最高位和最低位,进行比较,若不同则直接返回false。
java实现如下:
public class Solution {
public boolean isPalindrome(int x) {
if(x < 0)
return false;
int div = 1;
while(x / div >= 10){
div *= 10;
}
while(x != 0){
int left = x / div;
int right = x % 10;
if(left != right)
return false;
x = (x % div) / 10;
div = div / 100;
}
return true;
}
}