zoukankan      html  css  js  c++  java
  • 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 and 1.
    • 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]));
  • 相关阅读:
    Shell脚本
    数据结构 栈 java 自带的数据结构
    桃夭
    得道多助,失道寡助
    采薇
    离骚
    两小儿辩日
    鱼我所欲也
    生于忧患,死于安乐
    曹刿论战
  • 原文地址:https://www.cnblogs.com/gogolee/p/6657125.html
Copyright © 2011-2022 走看看