LeetCode 485. Max Consecutive Ones

标签：pre   osi   color   cut   max   dma   pos   inpu   div   

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]));

LeetCode 485. Max Consecutive Ones

标签：pre   osi   color   cut   max   dma   pos   inpu   div   

原文地址：http://www.cnblogs.com/gogolee/p/6657125.html