LeetCode刷题笔记-9

LeetCode-9. Palindrome Number（Easy）：

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
        """
        if x<0:
            return False
        s = str(x)
        if len(s)==1:
            return True
        s1 = s[0:len(s)//2]
        s2 = ''
        if len(s)%2==0:
            for i in range(len(s)-1,len(s)//2-1,-1):
                s2 += s[i]
        else:
            for i in range(len(s)-1,len(s)//2,-1):
                s2 += s[i]
        #print(s2)
        if s1 != '' and s2 != '':
            s1 = int(s1)
            s2 = int(s2)
        else:
            return False
        if s1==s2:
            return True
        else:
            return False