【LeetCode】9. 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 class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0 || x != 0 && x%10 ==0)
        {
            return false;
        }
 int temp = x; int ia = 0; while(temp != 0) { ia = ia*10 + temp%10; temp /= 10; } return ia==x; }}



还有一种比较巧妙的优化方法：将条件设置为x>temp，代码如下:

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0 || x != 0 && x%10 ==0)
        {
            return false;
        }
        
        int temp = 0;
        
        while(x > temp)
        {
            temp = temp*10+x%10;
            x /= 10;
        }
        
        return x == temp || x == temp/10;
    }
}