自己的:
def is_palindrome(n): l = str(n) m = len(l)-1 q = 0 for i in range(m): if l[i] == l[m-i]: q = q + 1 else: pass return q == m
神答案:
def is_palindrome(n): a = str(n) return a == a[::-1]
return q == m
请问段return的到底是啥..百度半天出不来
return 的是布尔值,真或假
果然是强啊
Sign in to make a reply
似水年华_
自己的:
def is_palindrome(n): l = str(n) m = len(l)-1 q = 0 for i in range(m): if l[i] == l[m-i]: q = q + 1 else: pass return q == m
神答案:
def is_palindrome(n): a = str(n) return a == a[::-1]