class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
mymax = 0
cnt = 0
for i in nums:
if i == 1:
cnt += 1
mymax = max(cnt,mymax)
else:
cnt = 0
return mymax
思路:一次遍历,从头开始计数 遇到0 则判断最是否为最长区间