[勇者闯LeetCode] 9. Palindrome Number

fanguzhai

于 2017-03-05 22:10:03 发布

阅读量425

点赞数

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

本文链接：https://blog.csdn.net/fanguzhai/article/details/60479377

版权

LeetCode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

[勇者闯LeetCode] 9. Palindrome Number

Description

Determine whether an integer is a palindrome. Do this without extra space.

Information

Tags: Math
Difficulty: Easy

Solution

class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x < 0 or (x != 0 and x % 10 == 0):
            return False
        a, b = 0, x
        while b > a:
            a, b = a * 10 + b % 10, b // 10
        return a == b or a // 10 == b