본문 바로가기

아무고토 몰라효

검색하기
아무고토 몰라효
프로필사진 Always Newbie

  • 분류 전체보기 (66)
    • CS (0)
    • Coding Test (12)
    • Android (이론) (9)
    • Android ( JAVA ) (31)
      • 개발 (30)
      • 오류 (1)
    • Android ( Kotlin ) (5)
      • 개발 (5)
    • Flutter (7)
      • 개발 (7)
    • SQL (2)
      • ✦✧✧✧✧ (2)
Guestbook
관리 메뉴
  • 글쓰기
  • 방명록
  • RSS
  • 관리
반응형

목록palindrome (1)

아무고토 몰라효

[LeetCode] Palindrome Number

https://leetcode.com/problems/palindrome-number문제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..

Coding Test 2025. 7. 10. 15:34
Prev 1 Next

Blog is powered by kakao / Designed by Tistory

티스토리툴바