[leetcode]Max Consecutive Ones

非常简单，注意边界

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        maxCnt = 0
        cnt = 0
        for i in range(len(nums)):
            if nums[i] == 1:
                cnt += 1
                if cnt > maxCnt:
                    maxCnt = cnt
            else:
                cnt = 0
        return maxCnt