在Robert McCloskey的书《为小鸭让路》中,小鸭们的名字是Jack、Kack、Lack、Nack、Ouack、Pack、Quack。按照循环顺序输出这些名字:
代码如下:
prefixes = 'JKLMNOPQ'
suffix = 'ack'
for letter in prefixes:
print(letter + suffix)
输出是:
Jack
Kack
Lack
Mack
Nack
Oack
Pack
Qack
发现并不完全正确,改进程序如下:
prefixes = 'JKLMNOPQ'
suffix1 = 'ack'
suffix2 = 'uack'
for letter in prefixes:
if letter == 'O':
print(letter + suffix2)
elif letter == 'Q':
print(letter + suffix2)
else:
print(letter + suffix1)
结果如下:
Jack
Kack
Lack
Mack
Nack
Ouack
Pack
Quack
实现要求!
还能改进该算法么?