题目：

题解：

class Solution:def findMaxConsecutiveOnes(self, nums: List[int]) -> int:maxCount = count = 0for i, num in enumerate(nums):if num == 1:count += 1else:maxCount = max(maxCount, count)count = 0maxCount = max(maxCount, count)return maxCount