LeetCode 485. Max Consecutive Ones
Posted 一片叶子啊
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 485. Max Consecutive Ones相关的知识,希望对你有一定的参考价值。
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
代码:
var findMaxConsecutiveOnes = function(nums) { let count = 0; let max = 0; for(let i = 0 ; i < nums.length; i++) { if(nums[i]) { count++; if(max < count) max = count; }else { count = 0; } } return max; }; console.log(findMaxConsecutiveOnes([1,1,0,1,1,1]));
以上是关于LeetCode 485. Max Consecutive Ones的主要内容,如果未能解决你的问题,请参考以下文章
leetcode485. Max Consecutive Ones
[leetcode-485-Max Consecutive Ones]
LeetCode-485. Max Consecutive Ones
LeetCode 485. Max Consecutive Ones