Max Consecutive Ones — C# Coding Problem
Difficulty: easy | Category: array
Problem Description
Given a binary array `nums`, return the maximum number of consecutive `1`s in the array. **Constraints:** - `1 <= nums.length <= 10⁵` - `nums[i]` is either `0` or `1`.
Examples
Example 1
Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The last three ones form the longest run.
Example 2
Input: nums = [1,0,1,1,0,1]
Output: 2