Open Tcdian opened 4 years ago
/**
* @param {number} x
* @return {boolean}
*/
var isPalindrome = function(x) {
if (x === 0) {
return true;
}
if (x < 0 || x % 10 === 0) {
return false;
}
let reverseNum = 0;
while(x > reverseNum) {
reverseNum = reverseNum * 10 + x % 10;
x = Math.floor(x / 10);
}
return x === reverseNum || x === Math.floor(reverseNum / 10);
};
function isPalindrome(x: number): boolean {
if (x === 0) {
return true;
}
if (x < 0 || x % 10 === 0) {
return false;
}
let reverseNum = 0;
while(x > reverseNum) {
reverseNum = reverseNum * 10 + x % 10;
x = Math.floor(x / 10);
}
return x === reverseNum || x === Math.floor(reverseNum / 10);
};
9. Palindrome Number
判断一个整数是否是回文数。回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。
Example 1
Example 2
Example 3
Follow up