Leetcode 9. Palindrome Number(判斷回文數)with Javascript
標簽:
JavaScript
題目
Determine whether an integer is a palindrome. Do this without extra space.
Some hints: Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to string, note the restriction of using extra space.
You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?
There is a more generic way of solving this problem.
解題思路1/**
* @param {number} x
* @return {boolean}
*/
var isPalindrome = function(x) {
if(x < 0 || x > Math.pow(2,32)-1) return false;
if(x < 10) return true;
var str = ''+x;
str = str.split('').reverse().join('');
var num = parseInt(str);
return num == x;
};
解題思路2
/**
* @param {number} x
* @return {boolean}
*/
var isPalindrome = function(x) {
if(x < 0 || x > Math.pow(2,32)-1) return false;
if(x < 10) return true;
var num = x;
var recNum = x%10;
x = parseInt(x/10);
while(x != 0){
recNum = recNum*10;
recNum = recNum + x%10;
x = parseInt(x/10);
}
return recNum == num;
};
點擊查看更多內容
為 TA 點贊
評論
評論
共同學習,寫下你的評論
評論加載中...
作者其他優質文章
正在加載中
感謝您的支持,我會繼續努力的~
掃碼打賞,你說多少就多少
贊賞金額會直接到老師賬戶
支付方式
打開微信掃一掃,即可進行掃碼打賞哦