485. Find the number of consecutive 1 in the binary string 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: 3Explanation: the first and digits or the last three digits is consecutive 1s.    The maximum number of consecutive 1s is 3.

note:

• The input array would be only contain and 0 1 .
• The length of input array is a positive integer and would not exceed 10,000

Find the number of consecutive 1 in a binary string.

  
 

   
  

  
static public int FindMaxConsecutiveOnes(int[] nums) {
   
  

  
if (nums.Length == 0) {
   
  

  
return 0;
   
  

  
}
   
  

  
int maxNumber = 0;
   
  

  
int number = 0;
   
  

  
  for    ( int   i  =    0    I  <=   Nums   length    I  ++)    {  
   
  

  
if (i != nums.Length && nums[i] == 1) {
   
  

  
number++;
   
  

  
} else {
   
  

  
if (number > maxNumber) {
   
  

  
maxNumber = number;
   
  

  
}
   
  

  
number = 0;
   
  

  
}
   
  

  
}
   
  

  
return maxNumber;
   
  

  
}
  
 

From for notes (Wiz)

485. Find the number of consecutive 1 in the binary string Max consecutive Ones