leetcode: 485. Maximum number of consecutive 1s

Difficulty: Easy

Given a binary array nums, calculate the maximum number of consecutive 1 in it.

Example 1:

Input:nums = [1,1,0,1,1,1]Output:3Explanation: The first two and the last three are consecutive 1s, so the maximum number of consecutive 1s is 3.

Example 2:

Input:nums = [1,0,1,1,0,1]Output:2

Tip:

• 1 <= nums.length <= 10ⁿ
• n = 5
• nums[i] is either 0 or 1.

Solution:

class Solution:def findMaxConsecutiveOnes(self, nums: List[int]) -> int:Count = 0Max = 0for i in nums:if i == 1:Count += 1Max = max(Max,Count)if i == 0:Count = 0return Max