We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Max Consecutive Ones

Difficulty: Easy

Problem Description

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

Key Insights

  • The problem requires counting the maximum sequence of consecutive 1s in a binary array.
  • We can traverse the array while maintaining a count of consecutive 1s and updating the maximum count when we encounter a 0.
  • This can be efficiently solved in a single pass through the array (O(n) time complexity).

Space and Time Complexity

Time Complexity: O(n)
Space Complexity: O(1)

Solution

The solution involves using a simple linear scan of the array while maintaining two counters: one for the current count of consecutive 1s and another for the maximum count found so far. When we encounter a 0, we compare the current count to the maximum count and reset the current count. At the end of the traversal, we need to check once more to capture any sequences that may reach the end of the array.

Code Solutions

def findMaxConsecutiveOnes(nums):
    max_count = 0  # To store the maximum count of consecutive 1s
    current_count = 0  # To count the current streak of 1s
    
    for num in nums:
        if num == 1:
            current_count += 1  # Increment current count if the number is 1
        else:
            max_count = max(max_count, current_count)  # Update max count if current ends
            current_count = 0  # Reset current count for the next sequence
            
    return max(max_count, current_count)  # Final check for the last sequence
← Back to All Questions