Max Consecutive Ones
Description
Given a binary array nums
, return the maximum number of consecutive 1
's in the array.
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
Constraints:
1 <= nums.length <= 105
nums[i]
is either0
or1
.
Solution(javascript)
/**
* @param {number[]} nums
* @return {number}
*/
var findMaxConsecutiveOnes = function(nums) {
let count = 0;
let sum = 0;
for (let i = 0; i < nums.length; i++) {
if (nums[i] === 1) {
count++;
}
if (nums[i] === 0) {
count = 0;
}
if (count > sum) {
sum = count;
}
}
return sum;
};