9. Palindrome Number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?

Java

class Solution {
    public boolean isPalindrome(int x) {
        if(x > Integer.MAX_VALUE || x <Integer.MIN_VALUE || x < 0) {
            return false;
        }
        int palindrome = 0;
        int realNumber = x;
        while (realNumber > 0) {
            palindrome = palindrome * 10 + realNumber % 10;
            realNumber /= 10;
        }
        return palindrome == x;
    }
}

JS

/**
 * @param {number} x
 * @return {boolean}
 */
var isPalindrome = function(x) {
    if(x < 0 || (0 == x%10 && x !=0)) return false;
    if(x < 10) return true;
    x = String(x)
    for(var i=0, j=x.length -1; i < j; i+=1, j-=1) if(x[i] != x[j]) return false;
    return true;
};