Palindrome Number 回文

Given an integer x, return true if x is a palindrome, and false otherwise.

何謂回文→ 正讀反讀都能讀通的句子

意思是會給一個數字，如果是回文就回傳true,不是就回傳false

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

解法:

把提供的數字轉成字串，在切割反轉後串連，跟原始字串做比較

const isPalindrome = (num: number) => {
    const str = num.toString();
    return str === str.split('').reverse().join('');
};