Skip to content

Latest commit

 

History

History
19 lines (13 loc) · 442 Bytes

README.md

File metadata and controls

19 lines (13 loc) · 442 Bytes

485. Max Consecutive Ones

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

Example 1:

Given tree s:

Input: [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.

Note:

  1. The input array will only contain 0 and 1.
  2. The length of input array is a positive integer and will not exceed 10,000