Miyeon

#47 Palindrome Number

2021-07-08Algorithm

πŸ”₯ Palindrome NumberπŸ”₯

Example 1:

Input: x = 121;
Output: true;

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.

Example 4:

Input: x = -101;
Output: false;

μ ‘κ·Ό μˆœμ„œ

  1. μž…λ ₯받은 숫자λ₯Ό λ¬Έμžμ—΄λ‘œ λ³€κ²½
  2. λ¬Έμžμ—΄μ„ λ°°μ—΄λ‘œ λ³€ν™˜
  3. 배열을 reverse ν•˜κΈ°
  4. λ°°μ—΄ μš”μ†Œ ν•˜λ‚˜μ˜ λ¬Έμžμ—΄λ‘œ ν•©μΉ˜κΈ°
  5. λ¬Έμžμ—΄μ„ 숫자둜 λ³€ν™˜
  6. 원본과 거꾸둜 뒀집은 μˆ«μžκ°€ κ°™μœΌλ©΄ true, μ•„λ‹ˆλ©΄ false λ¦¬ν„΄ν•˜κΈ°.

μ½”λ“œ μž‘μ„±

let isPalindrome = function(x) {
  let reversedX = parseInt(
    x
      .toString()
      .split("")
      .reverse()
      .join("")
  );

  return x === reversedX ? true : false;
};

WILT : What I Learned Today πŸ€”

  • μ•Œκ³ λ¦¬μ¦˜ 뿐만 μ•„λ‹ˆλΌ 개인 ν”„λ‘œμ νŠΈμ—μ„œλ„ μž…λ ₯받은 λ°μ΄ν„°μ˜ νƒ€μž…μ„ μ²΄ν¬ν•˜μ§€ μ•Šμ•„μ„œ μ½”λ“œ 였λ₯˜κ°€ λ°œμƒν•˜λŠ” κ²½ν—˜μ„ ν–ˆλ‹€. μ§€κΈˆ μž…λ ₯받은 λ°μ΄ν„°μ˜ νƒ€μž…μ΄ 무엇인지, λ‚΄κ°€ λ°”κΎΈκ³ μž ν•˜λŠ” λ°μ΄ν„°μ˜ νƒ€μž…μ€ 무엇이고, μ–΄λ–€ λ©”μ„œλ“œλ₯Ό μ‚¬μš©ν•˜λ©΄ λ˜λŠ”μ§€μ— λŒ€ν•΄ κ³ λ―Όν•˜λŠ” μ‹œκ°„μ„ μΆ©λΆ„νžˆ κ°€μ Έμ•Όκ² λ‹€.
  • μ’€ 더 도전적인 μˆ˜λ ¨μ„ μœ„ν•΄μ„œ μ•Œκ³ λ¦¬μ¦˜ λ‚œμ΄λ„λ‘€ μ„žμ–΄μ„œ 풀어보렀고 ν•œλ‹€. ν™€μˆ˜μΌμ—λŠ” λ‚œμ΄λ„ medium을 도전할 μ˜ˆμ •μ΄λ‹€.