zerovoids.dev
LEETCODEEasy

Palindrome Number

풀이일 2025 · 03 · 13기록 6 ms · 65.4 MB원문 leetcode ↗
Math
문제

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

 

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?
풀이 TypeScript
function isPalindrome(x: number): boolean {
  if(x < 0) return false;
  const str = x.toString();
  const length = str.length;
  const midIndex = Math.floor(length / 2) + length % 2;
  const prev = str.slice(0, midIndex - length % 2);
  const post = str.slice(midIndex)
  return prev.split('').reverse().join('') === post;
};
복사됨