29.Palindrome Number

Determine whether an integer is a palindrome. 

Do this without extra space.click to show spoilers.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.

分析：判断给定的一个数字是否是回文数。回文数指的是一个数从高位到低位与从低位到高位的数字完全一样。

首先负数不是回文数。对于非负数则从新计算这个数字从左至右为从低位到高位的大小。

public boolean isPalindrome(int x) {
		
		int temp = x;
		int n = 0;
		while(temp!=0){
			n = n*10 + temp%10;
			temp = temp/10;
		}
        return n==x;
    }