[9] Palindrome Number

1. 题目描述

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.

检查一个数字是否为回文。

2. 解题思路

翻转一个整数，使用一个数字来暂存翻转后的结果。翻转的方式为1234->4321 = (((4)*10+3)*10+2)*10+1，即使用前面的结果*10+最后一位的方式，使数字倒置。根据提示中所示，负数是不可能为回文的，因为不会出现“-11-”这样的数字。那么还有一个情况需要考虑，就是如果一个整数超过2147483647再产生进位就变为了一个负数不可能为一个回文了，加上这个判断又超过了15%的代码。

3. Code

public class Solution {
    public boolean isPalindrome(int x) {
        // 负数不可能成为回文
        if(x < 0) return false;
        int rev = 0;
        int cur = x;
        // 翻转数字
        while(cur > 0)
        {
            rev = rev*10 + cur%10;
            // 正数越界，返回false
            if(rev < 0) return false;
            cur/=10;
        }
        if(rev != x) return false;
        return true;
    }
}