Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
basic O(n) solution in Clear category for Long Repeat by sharma.vivek2231999
def long_repeat(line: str) -> int:
"""
length the longest substring that consists of the same char
"""
if len(line)<1:
return 0
longest=0
temp=0
last=line[0]
for c in line:
if last==c:
temp+=1
else:
last=c
if temp>longest:
longest=temp
temp=1
return temp if temp>longest else longest
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert long_repeat('sdsffffse') == 4, "First"
assert long_repeat('ddvvrwwwrggg') == 3, "Second"
assert long_repeat('abababaab') == 2, "Third"
assert long_repeat('') == 0, "Empty"
print('"Run" is good. How is "Check"?')
Feb. 19, 2020
