Discuss / Python / 最开始想到地方法,后续还会优化

最开始想到地方法,后续还会优化

Topic source

凡响skyline

#1 Created at ... [Delete] [Delete and Lock User]
def is_palindrome(n):
    s=str(n)
    for i in range(len(s)):
        if s[i] != s[len(s)-i-1]:
            return False
    return True

凡响skyline

#2 Created at ... [Delete] [Delete and Lock User]
def is_palindrome(n):
    """ 方法2:将其逆序再与原字符串比较 """
    s=str(n)
    # 逆序的方法有很多种,比如reversed()函数或者切片
    s_r=list(reversed(s))
    return list(s)==s_r

  • 1

Reply