LeetCode: Palindrome Number

最新推荐文章于 2025-08-15 09:45:14 发布

jerryhk

最新推荐文章于 2025-08-15 09:45:14 发布

阅读量237

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode 算法 Python

本文链接：https://blog.csdn.net/weixin_43957391/article/details/87928486

LeetCode 专栏收录该内容

15 篇文章

订阅专栏

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -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: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
Follow up:

Coud you solve it without converting the integer to a string?

判断一个整数是否是回文序列（负号也要计入）。先判断是否为负数，是的话返回false（直接返回false会导致Runtime Error，所以我返回了一个结果为false的式子）。针对非负数，将该整数逆序，判断是否和原整数相等，是的话即为回文序列。具体逆序方法参照LeetCode: Reverse Integer（本题要求不通过转换成字符串的方法求解）。

class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x < 0:
            return x > 0
        x1 = x
        y = 0
        while x:
            y = y * 10 + x % 10
            x = x // 10
        return x1 == y