DATA STRUCTURES • ALGORITHMS

Max Consecutive Ones

Given a binary array, find the maximum number of consecutive 1s in this array.

Time

O(N)

Space

O(1)

Key Principle 1

Linear scan of the array

Key Principle 2

Reset count on encountering 0

Key Principle 3

Maintain a global maximum

Key Principle 4

Optimal for streaming data

MAX_CONSEC_ONES_LAB
BINARY ARRAY:
Current Step
Find the maximum number of consecutive 1s in the array.
Playback
Counter Stats ⠿
CURRENT COUNT0
MAX COUNT0
Scan Logic ⠿
1int maxCount = 0, currentCount = 0;
2for (int x : arr) {
3    if (x == 1) {
4        currentCount++;
5        maxCount = max(maxCount, currentCount);
6    } else {
7        currentCount = 0;
8    }
9}
10return maxCount;
1
[0]
1
[1]
0
[2]
1
[3]
1
[4]
1
[5]
0
[6]
1
[7]

Loading Lab...