leetcode009-python 回文数

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?

解题要点：

1.注意输入时数字不能是字符串，所以不能用python切片那种来转换了；

2.定义了一个转化数字的函数；

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x < 0:
            return False
        else:
            ans = self.palin(x)
            if ans == x:
                return True
            else:
                return False

    def palin(self, y):
        ans = 0
        while(y!=0):
            ans = ans * 10 + (y % 10)
            y = int(y/10)
        return ans