/*****************************************************问题描述*************************************************
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?
就是判断一个数是否是回文数,依照给定的例子负数肯定不是回文数
/*****************************************************我的解答*************************************************
/**
* @param {number} x
* @return {boolean}
*/
var isPalindrome = function(x)
{
if(x < 0)
{
return false;
}
var originArr = [];
while(1)
{
if(parseInt(x / 10) >= 1)
{
originArr.push(x % 10);
x = parseInt(x / 10);
}
else
{
originArr.push(x);
break;
}
}
console.log(originArr);
for(var index = 0; index < originArr.length / 2; index++)
{
if(originArr[index] != originArr[originArr.length - 1 - index])
{
return false;
}
}
return true;
};
console.log(isPalindrome(10));
leetCode刷题记录3
最新推荐文章于 2024-08-10 16:13:14 发布