好的,所以我试图创建一个递归函数,如果函数是回文,则返回True,否则返回False.但是,它没有走到最后,随机停止.
码:
def is_palindrome(word):
if len(word) == 1 or len(word) == 0:
return True
else:
lst = len(word) - 1
if word[0] == word[lst]:
print(len(word), " --> ", word)
print(word[0], " # ", word[lst])
is_palindrome(word[0+1:lst])
else:
return False
对于我的生活,我无法弄清楚为什么.这是一个示例输出:
7 --> racecar
r # r
5 --> aceca
a # a
3 --> cec
c # c
^ It stops right here. Why doesn't it continue and return True when length = 1?