Leetcode Palindrome Number

丹

发布于 2018-09-04 11:37:32

3740

发布于 2018-09-04 11:37:32

文章被收录于专栏：WD学习记录WD学习记录

题目：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?

解答：

自己的答案：

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

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)

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2018年08月14日，如有侵权请联系 cloudcommunity@tencent.com 删除

integer