回文序列—Palindrome

>>> s = input()
abcde
>>> print(s + ‘‘.join(reversed(s)))
abcdeedcba

class Solution(object):
    def sum1(self, n):
        pal = str(n)
        size = len(pal)
        j = size - 1
        i = 0
        while i < j:
            if pal[i] == pal[j]:
                i += 1
                j -= 1
            else:
                return False
        return True
if __name__ == "__main__":
    s = Solution()
    print(s.sum1(n = ‘12‘))

>>> pal = "madam"
>>> is_palindrome = int(pal==pal[::-1])
>>> print(is_palindrome)
1