leetcode: 9. Palindrome Number

# Determine whether an integer is a palindrome. Do this without extra space.
#
# click to show spoilers.
#
# Some hints:
#
# Could negative integers be palindromes? (ie, -1)
#
# If you are thinking of converting the integer to string, 
# note the restriction of using extra space.
#
# You could also try reversing an integer. 
# However, if you have solved the problem "Reverse Integer", 
# you know that the reversed integer might overflow. How would you handle such case?
#
# There is a more generic way of solving this problem.

class Solution():
    def isPalindrome(self, x):
        if x < 0:
            return False
        l = list(str(x))
        return l == list(reversed(l))


if __name__ == '__main__':
    assert Solution().isPalindrome(1) == True
    assert Solution().isPalindrome(12321) == True
    assert Solution().isPalindrome(12320) == False
    assert Solution().isPalindrome(-12321) == False