Practice/Microsoft/Leetcode 485. Max Consecutive Ones

Leetcode 485. Max Consecutive Ones

CodingMust

Problem

You are given an array containing only binary values (0s and 1s). Your task is to find the length of the longest contiguous subsequence of 1s within the array.

For example, if the array contains several groups of consecutive 1s separated by 0s, you need to identify which group is the longest and return its length.

Requirements

1. Return an integer representing the maximum count of consecutive 1s
2. The solution should work in a single pass through the array
3. If there are no 1s in the array, return 0
4. The array will only contain the values 0 and 1

Constraints

• 1 ≤ array length ≤ 100,000
• Each element is either 0 or 1
• Time complexity should be O(n)
• Space complexity should be O(1)

Examples

Example 1:

Input: [1, 1, 0, 1, 1, 1] Output: 3 Explanation: The longest sequence of consecutive 1s is [1, 1, 1] at the end, which has length 3

Example 2:

Input: [1, 0, 1, 1, 0, 1] Output: 2 Explanation: The longest sequence of consecutive 1s is [1, 1] in the middle, which has length 2

Example 3:

Input: [0, 0, 0] Output: 0 Explanation: There are no 1s in the array, so the answer is 0

Example 4:

Input: [1, 1, 1, 1, 1] Output: 5 Explanation: The entire array is a sequence of 1s, so the answer is 5