Palindrome Number - Leetcode 算法详解

9.Palindrome Number

这是Leetcode上一道难度为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?

这道题和Reverse Integer比较相似，目的是判断输入的数字是否是回文（如1221是回文，123不是，负数也不是回文）。需要注意的一点是，题目要求不适用额外的空间，也就是把数字转换成字符串再计算是不可行的。参考我们在Reverse Integer中的做法，可以将输入数字reverse后得到的结果与原数字进行比较得到结果。

class Solution {
    public boolean isPalindrome(int x) {
        if(x<0)
            return false;
        int reverse=0;
        int temp=0;
        while(n!=0){
            temp=reverse*10+n%10;
            n/=10;
            reverse=temp;
        }
        if(x==reverse)
            return true;
        else
            return false;
    }
}