No.009 Palindrome Number

9. Palindrome Number

Total Accepted: 136330

Total Submissions: 418995

Difficulty: Easy

　　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.

　　思路：

　　本题解题很简单，首先判断负数和0，然后我们计算得到最大基数，如果x为一个两位数，则基数base=100，三位数则为1000等，然后我们每次分别取这个数的最高位和最低位进行比较，如果不相等，则直接返回false，相等则去掉最左边和最右边的数后进行下一轮比较。代码如下：

public boolean isPalindrome(int x) {
if(x < 0){
return false ;
}
if(x == 0 ){
return true ;
}

int base = 1 ;
while(x/base >= 10){
base *= 10 ;
}

while(x != 0){
int leftDigit = x/base ;
int rightDigit = x%10 ;
if(leftDigit != rightDigit){
return false ;
}
x = x%base/10 ;
base /= 100 ;
}
return true ;
}