Задача по питону

Question

Найти самое длинное сочетание АВ
Например: дан текстовый файл, с этим: BACBBBABABABCABBACBBBABABABABACBBACBCBABBACBBABABABACBCACBBCBBBBACBCBABBCBCBACBBABBCABABABCACBCBBACBBAABABBABBACBBBBACBBBAABABABBACBBACAABACABBABAABACBBABBABBCBBCABCBCACABBABBACBBACABBBBBABACACABABCACABAAAABBABABABBACABCBBBAABBBABCABAABABBBAABABBCABABCABBABABACABBACBCBBCBCBABBABABCBBACBBABACBBCBCBBBABACABCBCBBABACABCBBBBABBBABBACBBBBBBCACBBACABBCBAACABAABBBBBACBBBABABCABABCBBABBAAABABBACBCBCBBABABABABACBCBBCACBBBACBBABCACABBBAABABABCBBBABAABABBAABACABAABBABBAABABBABBACBCBBCBBCBBBBABBAABBABAACBCBACBBACBACABACACBCABABBCACBBCAABABCACBBCABACBBABAABABAABAABABACBBABABCACBBBABCBBAACBBABABBABBAABCACBBBBABCABBAABABABABBCABCBBACBBACBBACBCAABABABAABACBCBBABACBCBBABABABBCBBBABBACABBCBBCACBBACBCBBABABBAABBACABCBABCAABACBBCABABABBABBCBBCBABABABBAABBCABBAABABACBABBABAAABBBBABBABBBACABACBCBCACACACBCBCBBBCBBBCACBCBBBABBBABABABBBAACBBBABBACBBCBBCBBABBAABBABABAABABABABCACBAB

Денис Белоусов · Accepted Answer

n = 1
while string.find("AB" * n) != -1:
 n += 1
print (n - 1)

Jonni · Answer

Пусть тупо, но тоже работает...

s='BACBBBABABABCABBACBBBABABABABABABC'

import re
n=re.sub('AB','1', s)
maximal=0
for i in n:
~~if i=='1': count+=1
~~else: count=0
~~if count>maximal: maximal=count
 
print (maximal)

Марина Заборовская · Answer

import re
print(max(re.findall(r'((AB)\2*)', s))[0])