Leetcode:不使用额外空间的情况下，确定一个整数是不是回文数字。

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.

回文数定义：设n是一任意自然数。若将n的各位数字反向排列所得自然数n1与n相等，则称n为一回文数。例如，若n=1234321，则称n为一回文数；但若n=1234567，则n不是回文数。 

注意：

1.偶数个的数字也有回文数124421

2.负数和小数没有回文数

--------------------------------------------------------------------------------

思路：将整数反转，然后判断反转后的数字时候与原整数相等。

Java代码实现

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0)
            return false;
        int reverse = 0;
        int tmp = x;
        //数字反转操作
        while(tmp != 0){
            reverse = reverse * 10 + tmp % 10;
            tmp = tmp /10;
        }
        return reverse == x;
    }
}