我正在编写一个简单的代码来检查数字是否为回文。每当数字有两个连续的零时,print('removing',palind[-1])将列表中的错误零作为目标。
n = 200314413002
x = n
palind = []
while n > 0:
d = n % 10
n = n // 10
palind.append(d)
print(palind, 'is to check')
actual_palind = []
for i in palind:
if palind[0] == palind[-1] and len(palind) % 2 == 0:
print('removing',palind[0])
palind.remove(palind[0])
print('removing',palind[-1])
palind.remove(palind[-1])
print(palind,'is still a palindrome')
actual_palind.append(x)
else:
print(x,'is not a palindrome')
break
print(x, 'is a palindrome')
这是输出
[2, 0, 0, 3, 1, 4, 4, 1, 3, 0, 0, 2] is to check
removing 2
removing 2
[0, 0, 3, 1, 4, 4, 1, 3, 0, 0] is still a palindrome
removing 0
removing 0
[3, 1, 4, 4, 1, 3, 0, 0] is still a palindrome
200314413002 is not a palindrome
200314413002 is a palindrome
我错过了什么?
一只甜甜圈
拉莫斯之舞
相关分类