題目簡單:
class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
lens = len(nums)
maxCount = 0
Count = 0
for i in nums:
if i == 1:
Count += 1
if Count > maxCount:
maxCount = Count
else:
Count = 0
return maxCount