9. Palindrome Number

最新推荐文章于 2024-09-10 00:15:00 发布

emmmxuan

最新推荐文章于 2024-09-10 00:15:00 发布

阅读量114

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： LeetCode

本文链接：https://blog.youkuaiyun.com/qq_36341799/article/details/83349338

leetcode 专栏收录该内容

5 篇文章

订阅专栏

本文探讨了如何确定一个整数是否为回文数，即从前往后读和从后往前读都一样的数字。提供了几种解决方案，包括直接比较反转后的数字和原始数字，以及不转换成字符串的高级方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

"""
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?
"""
class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        return False if x<0 else x == int(str(x)[::-1])
        dict = {"(": 1, ")": -1, "[": 2, "]": -2, "{": 1, "}": 1, }
        count = 0
        num = ""
        for i in range(len(s)):
            count += dict[s[i]]
            num += str(abs(dict[s[i]]))
            if count == 0:
                num = ""
                if num == num[::-1]:
                    output = True
                else:
                    return False