Leetcode Palindrome Number

2018-09-04 11:37:32 浏览数 (1)

题目:Palindrome Number

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

Example 1:

代码语言:javascript复制
Input: 121
Output: true

Example 2:

代码语言:javascript复制
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:

代码语言:javascript复制
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?

解答:

自己的答案:

代码语言:javascript复制
class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        arr = []
        for s in str(x):
            arr.append(s)
        if len(arr)==0 or len(arr)==1:
            return True
        
        for i in range(len(arr)//2):
            if arr[i] !=arr[-i-1]:
                return False
        return True

参考最快的解决方法:Palindrome Number

代码语言:javascript复制
class Solution:
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        x_list = [i for i in str(x)]
        if x_list == x_list[::-1]:
            return (True)
        else:
            return (False)

0 人点赞