<p>
Give a binary array, find maximum number of consecutive 1s in this array
</p>
<p>
1. The input array only contain 0 and 1
</p>
<p>
2. The length of input array is a positive integer and will not exceed 10.000
</p>
JavaScript
var findMaxConsecutiveOnes = function(nums) {
let largestCount = 0;
let currentCount = 0;
for (let i = 0; i<nums.length; i++) {
if (nums[i] === 0) {
currentCount = 0;
} else {
currentCount++;
};
if (currentCount > largestCount) largestCount = currentCount;
};
return largestCount;
};
console.log(findMaxConsecutiveOnes([1,1,0,1,1,1]));
// output 3
console.log(findMaxConsecutiveOnes([1,0,0,1,0,1,1]));
// output 3
Please Whitelist JSFiddle in your content blocker.
Help keep JSFiddle free for always by one of two ways:
Whitelist JSFiddle in your content blocker (two clicks)
Go PRO and get access to additional PRO features →
Join the 4+ million users, and keep the JSFiddle dream alive.
Ad-free
All ads in the editor and listing pages are turned completely off.
Use pre-released features
You get to try and use features (like the Palette Color Generator) months before everyone else.
Fiddle collections
Sort and categorize your Fiddles into multiple collections.
Private collections and fiddles
You can make as many Private Fiddles, and Private Collections as you wish!
Console
Debug your Fiddle with a minimal built-in JavaScript console.