javascript - 如何通过在javascript中使用for循环来解决数字Pelindrom

Question

如何解决这个给出不希望的结果，总是出错。

function isPelindrom(n) {
    if (n < 0) return false;
    let orgNum = n
    let reversed = 0

    for (let x = 0; x <= orgNum; x++) {
        let lastDigit = orgNum % 10;
        reversed = (reversed * 10) + lastDigit;
        orgNum = parseInt(orgNum / 10);
    }
    return n == reversed
}


isPelindrom(12321)

标签： javascript

Answer 1

function Palindrome(num) {
  let numToStringArray = num.toString();

  const reversed = numToStringArray.toString().split('').reverse().join('');

  return numToStringArray === reversed ? "It's a palindrome" : "It's not a palindrome";
}

console.log(Palindrome(989));
console.log(Palindrome(23));
console.log(Palindrome(9));

function Palindrome(number) {

    var temp = number, final = 0;
    while (number > 0) {
        rem = number % 10;
        number = parseInt(number / 10);
        final = final * 10 + rem;
    }

    if (temp == final) {
        return "It's Palindrome";
    }
    else {
        return "It's not Palindrome";
    }

}

console.log(Palindrome(989));
console.log(Palindrome(23));
console.log(Palindrome(9));