# -*- coding: utf-8 -*-
def is_palindrome(s):
m = str(s)
n = len(m)//2
for x in range(n):
if m[x] != m[-x-1]:
return False
return True
Sign in to make a reply
陈妍素姬
# -*- coding: utf-8 -*-
def is_palindrome(s):
m = str(s)
n = len(m)//2
for x in range(n):
if m[x] != m[-x-1]:
return False
return True