Easy
Max Consecutive Ones
Easy
264 submissions
10 coins
+50 XP
Array
Problem Description
Given a binary array `nums`, return the length of the longest run of consecutive `1`s.
**Example 1:**
```
Input: nums = [1, 1, 0, 1, 1, 1]
Output: 3
```
**Example 2:**
```
Input: nums = [1, 0, 1, 1, 0, 1]
Output: 2
```
**Example 3:**
```
Input: nums = [0, 0]
Output: 0
```
Constraints
- `1 <= nums.length <= 10^5`
- `nums[i]` is `0` or `1`.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share