Leetcode (Easy): 9. Palindrome Number

9. Palindrome Number

Example 1:

Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.
Example 2:

Input: x = -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: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Constraints

-231 <= x <= 231 - 1

Follow up: Could you solve it without converting the integer to a string?

Answer

/**
 * @param {number} x
 * @return {boolean}
 */
var isPalindrome = function(x) {
    let answer;
    let numArr = x.toString().split('')
    let reverseNumArr = []

    for(let j = numArr.length-1; j >= 0; j--){
        reverseNumArr.push(numArr[j])
    }

     for(let k = 0; k < numArr.length; k++ ){
        if(numArr[k] === reverseNumArr[k]){
            answer = true
        }else {
            answer = false
        }
        if(numArr[k] !== reverseNumArr[k]){
            break
        }
     }

     return answer
};