aditya109/git-osp-for-beginners

Palindrome Number [C#-Solution required]

Open

#452 创建于 2021年10月3日

在 GitHub 查看
 (2 评论) (0 反应) (1 负责人)Java (252 fork)auto 404
C#Hacktoberfestgood first issue

仓库指标

Star
 (108 star)
PR 合并指标
 (30 天内没有已合并 PR)

描述

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not.

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

Constraints:

  • -231 <= x <= 231 - 1

Reference Link: [(1) Palindrome Number - LeetCode](

贡献者指南