9. Palindrome Number

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.
题意：判断给定数字是否为回文数字
代码如下（js）:

var isPalindrome = function(x) {
    if(x<0) return false;
    var xx=0,flag=x;
    //获取反转的数字
    while(x){
        //取余
        xx=xx*10+x%10;
        x=parseInt(x/10);
    }
    // console.log(xx);
    if(xx===flag) return true;
    return false;
};

9. Palindrome Number

原文：https://www.cnblogs.com/xingguozhiming/p/10380660.html