DEV Community

Abhishek Chaudhary
Abhishek Chaudhary

Posted on

1 1

Max Consecutive Ones

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.

SOLUTION:

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        nums.append(-1)
        maxOnes = 0
        curr = 0
        for num in nums:
            if num <= 0:
                maxOnes = max(maxOnes, curr)
                curr = 0
            else:
                curr += 1
        return maxOnes
Enter fullscreen mode Exit fullscreen mode

Top comments (0)

Sentry image

See why 4M developers consider Sentry, “not bad.”

Fixing code doesn’t have to be the worst part of your day. Learn how Sentry can help.

Learn more

AWS GenAI LIVE!

GenAI LIVE! is a dynamic live-streamed show exploring how AWS and our partners are helping organizations unlock real value with generative AI.

Tune in to the full event

DEV is partnering to bring live events to the community. Join us or dismiss this billboard if you're not interested. ❤️