def is_palindrome(n):
is_circle = True
tmp = str(n)
#偶数位数,如22, 2222, 2342
if len(tmp) % 2 == 0:
i = 0
while i < (len(tmp) / 2):
if(tmp[i] == tmp[len(tmp) - 1 -i]):
else:
is_circle = False
i = i + 1
#奇数位数,如2, 333, 23456
if len(tmp) % 2 == 1:
while i < ((len(tmp) - 1) / 2):
return is_circle
Sign in to make a reply
不长到140斤不改名字
def is_palindrome(n):
is_circle = True
tmp = str(n)
#偶数位数,如22, 2222, 2342
if len(tmp) % 2 == 0:
i = 0
while i < (len(tmp) / 2):
if(tmp[i] == tmp[len(tmp) - 1 -i]):
is_circle = True
else:
is_circle = False
i = i + 1
#奇数位数,如2, 333, 23456
if len(tmp) % 2 == 1:
i = 0
while i < ((len(tmp) - 1) / 2):
if(tmp[i] == tmp[len(tmp) - 1 -i]):
is_circle = True
else:
is_circle = False
i = i + 1
return is_circle