[Leetcode刷题] 第9题 Palindrome Number 回文数

题目：

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.

解题思路：

翻转数字，看它是否等于反转前的数字

具体代码：

class Solution:
    # @param x, an integer
    # @return a boolean
    def isPalindrome(self, x: int) -> bool:
        if x < 0:
            return False
        p, res = x, 0
        while p:
            res = res * 10 +  p % 10
            p //= 10
        return res == x


if __name__ == '__main__':
    o = Solution()
    s = 11
    a = o.isPalindrome(x = s)
    print(a)