[LeetCode] Palindrome Number - JavaScript

👩🏻‍💻 문제

LeetCode #9 Palindrome Number

👩🏻‍💻 풀이

var isPalindrome = function(x) {
    const MinNum = -2147483648; //-2^31 값
    const MaxNum = 2147483647;  //2^31-1 값
    
    if(x < MinNum || x > MaxNum) {
        return false;
    }
    
    const reverse =  x.toString().split("").reverse().join("");
    return x === Number(reverse);
};