In this kata you are required to, given a string, replace every letter with its position in the alphabet.
If anything in the text isn't a letter, ignore it and don't return it.
def alphabet_position(text):
number = []
alphabets = list(text.lower())
for alphabet in alphabets:
if ord(alphabet) > 97 and ord(alphabet) < 122:
number.append(ord(alphabet)-96)
else:
pass;
number_2 = [str(i) for i in number]
return " ".join(number_2)
还在考虑哪里错了。
附高分参考答案
def alphabet_position(text):
alphabet = 'abcdefghijklmnopqrstuvwxyz'
return ' '.join(str(alphabet.index(x) + 1) for x in text.lower() if x.isalpha())

被折叠的 条评论
为什么被折叠?



