leetcode.0009. Palindrome Number

leetcode.0009. 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.

Follow up:

Coud you solve it without converting the integer to a string?

参考答案1(python3)：

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        flag = x>=0          # 可以省去符号判断，参考答案3
        num = str(abs(x))
        num_reverse = num[::-1]

        if flag:
            if num == num_reverse:
                return True
            else:
                return False
        else:
            return False

参考答案2(python3)：

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        y = 0
        x_repeat = x
        flag = x>=0
        x_len = len(list(str(x)))

        if flag:
            for i in range(x_len):
                y = y*10 + x%10
                x //=10
            if y == x_repeat:
                return True
            else:
                return False
        else:
            return False

参考答案3(python3)：

class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        x = str(x)
        if x == x[::-1]:
            return True
        else:
            return False

答案1与答案2 参考leetcode.0007
有互通性