Skip to content

485. Max Consecutive Ones

Array

Problem - Max Consecutive Ones

Easy

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.

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        max_cons = 0
        running_count = 0

        for num in nums:
            if num:
                running_count += 1
                max_cons = max(max_cons, running_count)
            else:
                running_count = 0

        return max_cons

Submission Stats:

  • Runtime: 28 ms (50.48%)
  • Memory: 20.1 MB (55.96%)