题目出处:https://leetcode.com/problems/palindrome-number/
题目描述:
确定整数是否是回文。 当它向前读取向后时,整数是回文。
回文就是无论是从左至右还是从右至左,结果都一样。已经确定是整数,不含字母。
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.
代码:
/**
* @param {number} x
* @return {boolean}
*/
var isPalindrome = function(x) {
var result = true;
var xb;
xb = x.toString().split('').reverse();
xb = Number(xb.join(''));
if(xb !== x){
result = !result
}
return result
};