提交 128affd7 编写于 作者: F feilong

改进8题+fix4

上级 9289fcc5
......@@ -55,10 +55,12 @@ def top_words(splits, text, top_n=5):
while i < len(text):
c = text[i]
if c in splits:
# 过滤掉分隔字符串
while i+1 < len(text) and text[i+1] in splits:
i += 1
word = ''.join(chars).lower()
# 统计词频
# TODO(You): 请在此添加代码
chars = []
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册