题目翻译*

Palindrome Number - LeetCode

 Palindrome Number

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 a palindrome while 123 is not.

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

回文

给你一个整数x是回文，返回true。（当一个整数从前读和从后读都一样时为回文）

  比如：121是回文123不是回文。

例子1：

输入: x=121

输出：true

解释: 121 从左往右和从右往左读都是121

例子2：

输入：x=-121

输出：false

解释：从左往右为-121，从右往左为121-，这不是回文

例子3：

输入：x=10

输出：false

解释：从右往左读为01，这不是回文。

限制：

-2e31<=x<=2e31-1