Palindrome Number

最新推荐文章于 2022-11-28 10:34:26 发布

Goofiness

最新推荐文章于 2022-11-28 10:34:26 发布

阅读量96

点赞数

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

本文链接：https://blog.csdn.net/byr_wy/article/details/83691924

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Palindrome Number

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

Example

Input: 121
Output: true
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.

Solution

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x<0:
            return False
        ite = 1
        while x/ite>=10:
            ite *= 10
        while x:
            left = int(x/ite)
            right = int(x%10)
            if left!=right:
                return False
            x = (x % ite)/10
            ite = ite/100
        return True