XX 알고리즘 문제 3

palindrome

def solution(n):
    s = str(n)
    size = len(s)
    if size==0:
        return False
    for i in range(size//2):
        if s[i]!=s[size-i-1]:
            return False
    return True



print ( solution(12345) )
print ( solution(-101) )
print ( solution(11111) )
print ( solution(12421) )

False
False
True
True