leetcode

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