# 给定一个二进制数组 nums , 计算其中最大连续 1 的个数。
class Solution:
def findMaxConsecutiveOnes(self, nums: list[int]) -> int:
if nums is None or nums == 0:
return 0
else:
count = 0
result = 0
for i in range(len(nums)):
if nums[i] == 1:
count += 1
else:
result = max(result, count)
count = 0
return max(result, count)
# test code
test = [1,1,0,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,1,1]
ret = Solution.findMaxConsecutiveOnes(None, nums = test)
print(ret)