def is_palindrome(n):
#转str
x = str(n)
if len(x)<2:
return True
else:
# 找出中间位置
# python中‘/’结果为float,并不是int,所以需要转int
l = int(len(x) / 2)
# 标识前半段序号i
i = 0
# 标识后半段序号j
j = len(x) - 1
while i < l:
if x[i] == x[j]:
i = i + 1
j = j - 1
break
if i == l:
return False
Sign in to make a reply
YOUTH
def is_palindrome(n):
#转str
x = str(n)
if len(x)<2:
return True
else:
# 找出中间位置
# python中‘/’结果为float,并不是int,所以需要转int
l = int(len(x) / 2)
# 标识前半段序号i
i = 0
# 标识后半段序号j
j = len(x) - 1
while i < l:
if x[i] == x[j]:
i = i + 1
j = j - 1
else:
break
if i == l:
return True
else:
return False