Question

In an array, a "run" occurs when 2 or more consecutive elements match. For example in the array {2, 3, 3, 3, 3, 5, 5 6} there is a run of threes, and a run of fives. The length of the run of threes is 4 (because there are 4 threes in a row). Write a method that returns the length of the longest run. If no run occurs, return 0. maxRun([2, 3, 3, 3, 3, 5, 5, 6]) rightarrow 4 max Run([1, 1, 1, 2, 2, 2]) rightarrow 3 maxRun([4, 5]) rightarrow 0

Answer 1

def maxRun(lst):
l = len(lst)
count = 1
maxCount = 0
for i in range(l-1):
if lst[i] == lst[i+1]:
count = count + 1
else:
if maxCount < count:
maxCount = count
count = 1
if maxCount == 1:
return maxCount-1
return maxCount

print(maxRun([2,3,3,3,3,5,5,6]))
print(maxRun([1,1,1,2,2,2]))
print(maxRun([4,5]))

Output:

sh-4.3$ python3 main.py                                                                                                                                                                                                                                                

4                                                                                                                                                                                                                                                                      

3                                                                                                                                                                                                                                                                      

0

xecute > Share Code main.py x - def maxRun(1st): 1 len(1st) count1 maxCount0 for i in range (1-1): if 1st[i]1st[i+1]: countcount 1 if count1 else: maxCount < count: maxCount count return maxCount print (maxRun([2,3,3,3,3,5,5,6])) print (maxRun([1,1,1,2,2,2])) print (maxRun ([4,5]))