Easy

Quiz

#485 Max Consecutive Ones

APPROACH

Given a binary array nums, find the longest contiguous run of 1's and return its length.

Example 1:

Input: nums = [1,1,0,1,1,1]

Output: 3

Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.

Example 2:

Input: nums = [1,0,1,1,0,1]

Output: 2

1 of 4

1:00

What is the optimal approach for this problem?