Discuss / Python / 回文数
Back

回文数

Topic source

我就不信还有人起这昵称

#1 Created at ... [Delete] [Delete and Lock User]

def is_pailndrome(n): n = str(n) left = n[:int(len(n)/2)] right = n[int(len(n)/2) + 1:][::-1] return left == right

output = list(filter(is_pailndrome, range(1, 1000)))

print(output)

我就不信还有人起这昵称

#2 Created at ... [Delete] [Delete and Lock User]

def is_pailndrome(n): n = str(n) if(len(n) == 2): return n[0] == n[1] left = n[:int(len(n)/2)] right = n[int(len(n)/2) + 1:][::-1] return left == right

output = list(filter(is_pailndrome, range(1, 1000)))

print(output)

  • 1

Reply