[Leetcode 16] 9 Palindrome Number

Problem:

Determine whether an integer is a palindrome. Do this without extra space.

Analysis:

One tricky way to do this is to convert it into string and then use the normal palindrome way to solve the problem. Though it violates the requirement of "no extra space", the online judger won't judge whether we are using extra space or not.

The normal way is to check from the leftmost and rightmost digit, toward the mid digit. Give special attention to negative numbers

Code:

Tricky way:

Normal way:

public class Solution {
    public boolean isPalindrome(int x) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if (x < 0) return false;
        
        int base = 1;
        while (x / base >= 10) {
            base *= 10;
        }
        
        
        int left=0, right=0;
        while (x > 0) {
            left = x / base;
            right = x % 10;
            
            if (left != right)
                return false;
            
            
            x = (x - left*base) / 10;
            base /= 100;
        }
        
        return true;
    }
}

Attention: