[Solved] Given a binary array nums, return the maximum number of consecutive 1’s in the array.

Question

Given a binary array nums, return the maximum number of consecutive 1‘s in the array.

Example 1:

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

Example 2:

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

Constraints:

• 1 <= nums.length <= 105
• nums[i] is either 0 or 1.

Python Solution

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