这个是leetcode中判断是否为回文的python代码，我的主要想法是每一次比较首位和末尾的数字是否相同，然后丢弃两位再进行判断
a
= input()
a
= int(a)
if a
< 0:
print(
False)
else:
b
= a
i
= 0
while b
:
i
= i
+ 1
b
= b
// 10
length
= i
b
= a
sign = 0
while length
> 1:
if b
// pow(
10,length
- 1)
== b
% 10:
b
= b
% pow(
10,length
-1)
b
= b
// 10
length
= length
- 2
else:
sign = 1
break
if sign == 0:
print(
True)
else:
print(
False)
转载请注明原文地址: https://www.6miu.com/read-70063.html
