在Python中查找具有相同首字母单词的最长连续子列表长度的程序
假设我们有一个称为单词的小写字母字符串列表。我们必须找到最长连续子列表的长度，其中每个单词的第一个字母具有相同的第一个字母。
所以，如果输入像words=["she","sells","seashells","on","the","sea","shore"]，那么输出将是3，最长的连续子列表是["she","sells","seashells"]。每个单词的第一个字母是“s”。
示例
让我们看下面的实现来更好地理解
def solve(words):
cnt = 1
maxcnt = 0
prev_char = ""
for word in words:
if prev_char == "":
prev_char = word[0]
elif prev_char == word[0]:
cnt += 1
else:
prev_char = word[0]
cnt = 1
maxcnt = max(maxcnt, cnt)
return maxcnt
words = ["she", "sells", "seashells", "on", "the", "sea", "shore"]
print(solve(words))输入
["she", "sells", "seashells", "on", "the", "sea", "shore"]输出结果
3