【LeetCode】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)
            return false;
        if(x<10)
            return true;
        
        int max = 1;
        int t =x;
        while(!(t/max<10))
            max*=10;
        
        int min=10;
        int right = 0;
        while(min<=max){
            if((x-right)/max!=x%10)
                return false;            
            right+=(max*((x-right)/max));
            max=max/100;
            x=x/10;
            right/=10;
            
        }
        return true;
        
    }
}

public class NSolution {
    public boolean isPalindrome(int x) {
        if (x < 0)
            return false;
        int div = 1;
        while (x / div >= 10)
            div *= 10;
        while (x > 0) {
            int l = x / div;
            int r = x % 10;
            if (l != r)
                return false;
            x = x % div / 10;
            div /= 100;
        }
        return true;
    }
}