xxxxxxxxxx
# Given a list of numbers as input, find and return the length of the longest consecutive sub-list of 1s.
def max_consecutive_ones(l):
ones_counter = 0
max_ones_length = 0
for val in l:
if val == 1:
ones_counter += 1
else:
max_ones_length = max(ones_counter, max_ones_length)
ones_counter = 0
return max_ones_length