Max Consecutive Ones
Description
Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
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:
- The input array will only contain
0
and1
. - The length of input array is a positive integer and will not exceed 10,000
Solution(javascript)
/**
* @param {number[]} nums
* @return {number}
*/
const findMaxConsecutiveOnes = function (nums) {
let max = 0
let current = 0
for (let index = 0; index < nums.length; index++) {
if (nums[index] === 1) {
current += 1
} else {
current = 0
}
max = Math.max(current, max)
}
return max
}