LeetCode OJ 之 Palindrome Number

题目：Determine whether an integer is a palindrome. Do this without extra space.
题目给出的hint：

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.
解决思路：题目要求不能使用额外的空间，那么转换成string然后按照判断字符串的方法来判断是否为回文数应该是不可行的，应此解决方法如下：

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0){
            return false;
        }
        if(x < 10){
            return true;
        }
        int sum = 0;
        int reserve = x;
        while(x > 0){
            sum = sum*10 + x%10;
            x = x/10;
        }
        if(sum == reserve){
            return true;
        }else{
            return false;
        }

    }
}